./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/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_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/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-0cd3be1 [2018-11-28 12:46:44,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:46:44,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:46:44,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:46:44,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:46:44,602 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:46:44,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:46:44,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:46:44,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:46:44,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:46:44,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:46:44,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:46:44,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:46:44,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:46:44,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:46:44,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:46:44,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:46:44,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:46:44,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:46:44,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:46:44,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:46:44,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:46:44,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:46:44,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:46:44,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:46:44,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:46:44,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:46:44,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:46:44,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:46:44,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:46:44,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:46:44,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:46:44,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:46:44,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:46:44,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:46:44,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:46:44,626 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:46:44,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:46:44,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:46:44,638 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:46:44,638 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:46:44,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:46:44,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:46:44,639 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:46:44,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:46:44,639 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:46:44,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:46:44,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:46:44,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:46:44,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:46:44,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:46:44,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:46:44,640 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:46:44,640 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:46:44,641 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:46:44,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:46:44,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:46:44,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:46:44,641 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:46:44,641 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:46:44,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:46:44,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:46:44,642 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:46:44,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:46:44,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:46:44,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:46:44,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:46:44,645 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_65bc36d4-0781-415a-a67a-575ac84b8789/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-11-28 12:46:44,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:46:44,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:46:44,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:46:44,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:46:44,687 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:46:44,687 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 12:46:44,733 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/data/b3c065753/5311784115d54c2b81cae16d8bcbf20e/FLAG3e3157cca [2018-11-28 12:46:45,175 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:46:45,175 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 12:46:45,189 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/data/b3c065753/5311784115d54c2b81cae16d8bcbf20e/FLAG3e3157cca [2018-11-28 12:46:45,502 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/data/b3c065753/5311784115d54c2b81cae16d8bcbf20e [2018-11-28 12:46:45,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:46:45,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:46:45,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:46:45,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:46:45,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:46:45,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:46:45" (1/1) ... [2018-11-28 12:46:45,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328536cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:45, skipping insertion in model container [2018-11-28 12:46:45,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:46:45" (1/1) ... [2018-11-28 12:46:45,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:46:45,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:46:45,859 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:46:45,863 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:46:46,025 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:46:46,043 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:46:46,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46 WrapperNode [2018-11-28 12:46:46,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:46:46,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:46:46,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:46:46,044 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:46:46,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:46:46,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:46:46,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:46:46,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:46:46,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... [2018-11-28 12:46:46,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:46:46,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:46:46,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:46:46,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:46:46,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/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-11-28 12:46:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-28 12:46:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-28 12:46:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-28 12:46:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-28 12:46:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-28 12:46:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-28 12:46:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-28 12:46:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-28 12:46:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:46:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:46:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-28 12:46:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-28 12:46:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-28 12:46:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-28 12:46:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-28 12:46:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-28 12:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-28 12:46:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-28 12:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-28 12:46:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-28 12:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-28 12:46:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-28 12:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-28 12:46:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-28 12:46:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-28 12:46:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-28 12:46:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-28 12:46:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-28 12:46:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-28 12:46:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-28 12:46:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-28 12:46:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-28 12:46:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-28 12:46:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-28 12:46:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-28 12:46:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-28 12:46:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-28 12:46:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-28 12:46:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-28 12:46:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-28 12:46:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-28 12:46:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-28 12:46:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-28 12:46:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-28 12:46:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:46:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:46:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-28 12:46:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-28 12:46:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-28 12:46:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-28 12:46:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:46:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:46:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-28 12:46:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-28 12:46:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-28 12:46:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-28 12:46:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-28 12:46:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-28 12:46:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-28 12:46:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-28 12:46:46,508 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,509 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:46,576 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,577 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:46,667 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,667 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:46,751 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,751 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:46,804 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,804 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:46,928 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,928 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:46,966 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,967 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:46,991 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:46,991 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:47,184 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:46:47,184 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:46:47,198 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:46:47,199 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:46:47,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:46:47 BoogieIcfgContainer [2018-11-28 12:46:47,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:46:47,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:46:47,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:46:47,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:46:47,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:46:45" (1/3) ... [2018-11-28 12:46:47,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5910beff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:46:47, skipping insertion in model container [2018-11-28 12:46:47,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:46:46" (2/3) ... [2018-11-28 12:46:47,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5910beff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:46:47, skipping insertion in model container [2018-11-28 12:46:47,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:46:47" (3/3) ... [2018-11-28 12:46:47,205 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 12:46:47,212 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:46:47,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:46:47,233 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:46:47,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:46:47,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:46:47,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:46:47,261 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:46:47,261 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:46:47,261 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:46:47,261 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:46:47,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:46:47,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:46:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2018-11-28 12:46:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:46:47,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:47,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:47,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:47,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2018-11-28 12:46:47,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:47,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:47,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:47,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:47,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:47,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:47,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:47,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:47,523 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2018-11-28 12:46:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:47,677 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2018-11-28 12:46:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:47,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 12:46:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:47,689 INFO L225 Difference]: With dead ends: 887 [2018-11-28 12:46:47,689 INFO L226 Difference]: Without dead ends: 507 [2018-11-28 12:46:47,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-11-28 12:46:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-11-28 12:46:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-11-28 12:46:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2018-11-28 12:46:47,763 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2018-11-28 12:46:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:47,763 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2018-11-28 12:46:47,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2018-11-28 12:46:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:46:47,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:47,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:47,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:47,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2018-11-28 12:46:47,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:47,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:47,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:47,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-11-28 12:46:47,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:47,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:47,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:47,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:47,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:47,904 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2018-11-28 12:46:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:48,144 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2018-11-28 12:46:48,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:48,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:46:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:48,151 INFO L225 Difference]: With dead ends: 789 [2018-11-28 12:46:48,151 INFO L226 Difference]: Without dead ends: 670 [2018-11-28 12:46:48,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-28 12:46:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2018-11-28 12:46:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-28 12:46:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2018-11-28 12:46:48,192 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2018-11-28 12:46:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:48,193 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2018-11-28 12:46:48,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2018-11-28 12:46:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:46:48,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:48,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:48,196 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:48,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:48,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1491411356, now seen corresponding path program 1 times [2018-11-28 12:46:48,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:48,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:48,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:48,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:48,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:48,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:48,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:48,272 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2018-11-28 12:46:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:48,321 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2018-11-28 12:46:48,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:48,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:46:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:48,325 INFO L225 Difference]: With dead ends: 995 [2018-11-28 12:46:48,325 INFO L226 Difference]: Without dead ends: 819 [2018-11-28 12:46:48,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-28 12:46:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2018-11-28 12:46:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-11-28 12:46:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2018-11-28 12:46:48,362 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2018-11-28 12:46:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:48,363 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2018-11-28 12:46:48,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2018-11-28 12:46:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:46:48,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:48,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:48,365 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:48,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1315443348, now seen corresponding path program 1 times [2018-11-28 12:46:48,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:48,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:48,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:48,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:48,408 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2018-11-28 12:46:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:48,560 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2018-11-28 12:46:48,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:48,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:46:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:48,569 INFO L225 Difference]: With dead ends: 1424 [2018-11-28 12:46:48,569 INFO L226 Difference]: Without dead ends: 1160 [2018-11-28 12:46:48,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-11-28 12:46:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2018-11-28 12:46:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-11-28 12:46:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2018-11-28 12:46:48,625 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2018-11-28 12:46:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:48,625 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2018-11-28 12:46:48,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2018-11-28 12:46:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:46:48,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:48,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:48,627 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:48,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1932537431, now seen corresponding path program 1 times [2018-11-28 12:46:48,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:48,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:48,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:48,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:48,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:48,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:48,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:46:48,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:46:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:46:48,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:48,700 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2018-11-28 12:46:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:49,442 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2018-11-28 12:46:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:46:49,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-28 12:46:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:49,456 INFO L225 Difference]: With dead ends: 1562 [2018-11-28 12:46:49,456 INFO L226 Difference]: Without dead ends: 984 [2018-11-28 12:46:49,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:46:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-11-28 12:46:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2018-11-28 12:46:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-28 12:46:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2018-11-28 12:46:49,546 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2018-11-28 12:46:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:49,547 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2018-11-28 12:46:49,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:46:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2018-11-28 12:46:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 12:46:49,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:49,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:49,549 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:49,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash -487494679, now seen corresponding path program 1 times [2018-11-28 12:46:49,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:49,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:49,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:49,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:49,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:49,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:49,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:49,610 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2018-11-28 12:46:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:49,687 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2018-11-28 12:46:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:49,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 12:46:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:49,693 INFO L225 Difference]: With dead ends: 890 [2018-11-28 12:46:49,693 INFO L226 Difference]: Without dead ends: 886 [2018-11-28 12:46:49,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-28 12:46:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-11-28 12:46:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-28 12:46:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2018-11-28 12:46:49,740 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2018-11-28 12:46:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:49,740 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2018-11-28 12:46:49,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2018-11-28 12:46:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:46:49,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:49,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:49,742 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:49,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:49,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1261036943, now seen corresponding path program 1 times [2018-11-28 12:46:49,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:49,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:49,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:49,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:49,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:49,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:49,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:49,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:49,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:49,781 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2018-11-28 12:46:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:49,846 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2018-11-28 12:46:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:49,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 12:46:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:49,852 INFO L225 Difference]: With dead ends: 1274 [2018-11-28 12:46:49,852 INFO L226 Difference]: Without dead ends: 1015 [2018-11-28 12:46:49,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-11-28 12:46:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2018-11-28 12:46:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-28 12:46:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2018-11-28 12:46:49,905 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2018-11-28 12:46:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:49,905 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2018-11-28 12:46:49,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2018-11-28 12:46:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:46:49,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:49,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:49,909 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:49,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2018-11-28 12:46:49,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:49,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:49,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:49,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:49,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:49,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:49,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:49,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:49,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:49,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:49,993 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2018-11-28 12:46:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:50,065 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2018-11-28 12:46:50,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:50,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-28 12:46:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:50,071 INFO L225 Difference]: With dead ends: 972 [2018-11-28 12:46:50,072 INFO L226 Difference]: Without dead ends: 954 [2018-11-28 12:46:50,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-11-28 12:46:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2018-11-28 12:46:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-28 12:46:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2018-11-28 12:46:50,129 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2018-11-28 12:46:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:50,129 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2018-11-28 12:46:50,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2018-11-28 12:46:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:46:50,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:50,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:50,132 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:50,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1159920127, now seen corresponding path program 1 times [2018-11-28 12:46:50,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:50,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:50,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:50,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:50,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:50,187 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2018-11-28 12:46:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:50,249 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2018-11-28 12:46:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:50,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-28 12:46:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:50,254 INFO L225 Difference]: With dead ends: 1167 [2018-11-28 12:46:50,255 INFO L226 Difference]: Without dead ends: 925 [2018-11-28 12:46:50,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-28 12:46:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2018-11-28 12:46:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-28 12:46:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2018-11-28 12:46:50,318 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2018-11-28 12:46:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:50,318 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2018-11-28 12:46:50,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2018-11-28 12:46:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:46:50,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:50,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:50,321 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:50,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash -256141125, now seen corresponding path program 1 times [2018-11-28 12:46:50,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:50,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:50,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:50,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:46:50,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:46:50,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:46:50,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:46:50,367 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2018-11-28 12:46:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:50,661 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2018-11-28 12:46:50,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:46:50,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-28 12:46:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:50,665 INFO L225 Difference]: With dead ends: 1014 [2018-11-28 12:46:50,665 INFO L226 Difference]: Without dead ends: 785 [2018-11-28 12:46:50,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:46:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-28 12:46:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2018-11-28 12:46:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-11-28 12:46:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2018-11-28 12:46:50,714 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2018-11-28 12:46:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:50,715 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2018-11-28 12:46:50,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:46:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2018-11-28 12:46:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:46:50,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:50,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:50,717 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:50,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2018-11-28 12:46:50,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:50,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:50,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:50,778 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2018-11-28 12:46:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:50,833 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2018-11-28 12:46:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:50,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 12:46:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:50,837 INFO L225 Difference]: With dead ends: 871 [2018-11-28 12:46:50,837 INFO L226 Difference]: Without dead ends: 775 [2018-11-28 12:46:50,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-11-28 12:46:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2018-11-28 12:46:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-11-28 12:46:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2018-11-28 12:46:50,892 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2018-11-28 12:46:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:50,892 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2018-11-28 12:46:50,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2018-11-28 12:46:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:46:50,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:50,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:50,894 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:50,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2018-11-28 12:46:50,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:50,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:50,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:50,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:50,925 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2018-11-28 12:46:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:51,019 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2018-11-28 12:46:51,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:51,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 12:46:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:51,024 INFO L225 Difference]: With dead ends: 938 [2018-11-28 12:46:51,024 INFO L226 Difference]: Without dead ends: 928 [2018-11-28 12:46:51,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-11-28 12:46:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2018-11-28 12:46:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-11-28 12:46:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2018-11-28 12:46:51,067 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2018-11-28 12:46:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:51,068 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2018-11-28 12:46:51,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2018-11-28 12:46:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:46:51,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:51,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:51,070 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:51,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:51,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2018-11-28 12:46:51,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:51,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:51,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:46:51,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:46:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:46:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:46:51,118 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2018-11-28 12:46:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:51,251 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2018-11-28 12:46:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:46:51,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-28 12:46:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:51,255 INFO L225 Difference]: With dead ends: 851 [2018-11-28 12:46:51,255 INFO L226 Difference]: Without dead ends: 847 [2018-11-28 12:46:51,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:46:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-11-28 12:46:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2018-11-28 12:46:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-28 12:46:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2018-11-28 12:46:51,300 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2018-11-28 12:46:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:51,301 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2018-11-28 12:46:51,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:46:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2018-11-28 12:46:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:46:51,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:51,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:51,304 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:51,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2018-11-28 12:46:51,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:51,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:51,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:51,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:46:51,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:46:51,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:46:51,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:46:51,370 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2018-11-28 12:46:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:51,482 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2018-11-28 12:46:51,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:46:51,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-28 12:46:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:51,486 INFO L225 Difference]: With dead ends: 886 [2018-11-28 12:46:51,487 INFO L226 Difference]: Without dead ends: 865 [2018-11-28 12:46:51,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:46:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-28 12:46:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2018-11-28 12:46:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-11-28 12:46:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2018-11-28 12:46:51,534 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2018-11-28 12:46:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:51,534 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2018-11-28 12:46:51,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:46:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2018-11-28 12:46:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:46:51,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:51,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:51,537 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:51,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2018-11-28 12:46:51,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:51,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:51,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:51,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:51,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:51,566 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2018-11-28 12:46:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:51,667 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2018-11-28 12:46:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:51,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 12:46:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:51,671 INFO L225 Difference]: With dead ends: 1081 [2018-11-28 12:46:51,671 INFO L226 Difference]: Without dead ends: 1049 [2018-11-28 12:46:51,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-11-28 12:46:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2018-11-28 12:46:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-11-28 12:46:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2018-11-28 12:46:51,726 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2018-11-28 12:46:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:51,726 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2018-11-28 12:46:51,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2018-11-28 12:46:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:46:51,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:51,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:51,728 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:51,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2018-11-28 12:46:51,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:51,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:51,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:46:51,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:46:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:46:51,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:46:51,756 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2018-11-28 12:46:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:51,811 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2018-11-28 12:46:51,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:46:51,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-28 12:46:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:51,815 INFO L225 Difference]: With dead ends: 966 [2018-11-28 12:46:51,815 INFO L226 Difference]: Without dead ends: 944 [2018-11-28 12:46:51,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-11-28 12:46:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2018-11-28 12:46:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-11-28 12:46:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2018-11-28 12:46:51,882 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2018-11-28 12:46:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:51,883 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2018-11-28 12:46:51,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:46:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2018-11-28 12:46:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:46:51,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:51,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:51,885 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:51,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2018-11-28 12:46:51,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:51,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:51,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:51,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:46:51,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:46:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:46:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:46:51,945 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2018-11-28 12:46:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:52,852 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2018-11-28 12:46:52,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:46:52,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-28 12:46:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:52,857 INFO L225 Difference]: With dead ends: 1110 [2018-11-28 12:46:52,857 INFO L226 Difference]: Without dead ends: 1016 [2018-11-28 12:46:52,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:46:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-11-28 12:46:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2018-11-28 12:46:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-28 12:46:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2018-11-28 12:46:52,915 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2018-11-28 12:46:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:52,915 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2018-11-28 12:46:52,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:46:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2018-11-28 12:46:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:46:52,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:52,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:52,918 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:52,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:52,918 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2018-11-28 12:46:52,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:52,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:52,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:52,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:52,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:52,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:52,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:46:52,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:46:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:46:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:46:52,997 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 9 states. [2018-11-28 12:46:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:54,724 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2018-11-28 12:46:54,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:46:54,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-28 12:46:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:54,730 INFO L225 Difference]: With dead ends: 1188 [2018-11-28 12:46:54,730 INFO L226 Difference]: Without dead ends: 1119 [2018-11-28 12:46:54,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:46:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-11-28 12:46:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 887. [2018-11-28 12:46:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-28 12:46:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1205 transitions. [2018-11-28 12:46:54,789 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1205 transitions. Word has length 50 [2018-11-28 12:46:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:54,789 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1205 transitions. [2018-11-28 12:46:54,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:46:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1205 transitions. [2018-11-28 12:46:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:46:54,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:54,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] [2018-11-28 12:46:54,791 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:54,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2018-11-28 12:46:54,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:54,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:54,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:54,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:54,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:54,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:54,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:54,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:54,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:54,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:54,849 INFO L87 Difference]: Start difference. First operand 887 states and 1205 transitions. Second operand 3 states. [2018-11-28 12:46:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:54,955 INFO L93 Difference]: Finished difference Result 912 states and 1233 transitions. [2018-11-28 12:46:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:54,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 12:46:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:54,959 INFO L225 Difference]: With dead ends: 912 [2018-11-28 12:46:54,959 INFO L226 Difference]: Without dead ends: 907 [2018-11-28 12:46:54,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-28 12:46:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2018-11-28 12:46:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-11-28 12:46:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2018-11-28 12:46:55,011 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 52 [2018-11-28 12:46:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:55,011 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2018-11-28 12:46:55,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2018-11-28 12:46:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:46:55,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:55,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:55,014 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2018-11-28 12:46:55,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:55,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:55,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-11-28 12:46:55,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:55,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:55,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:55,053 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand 3 states. [2018-11-28 12:46:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:55,169 INFO L93 Difference]: Finished difference Result 1116 states and 1511 transitions. [2018-11-28 12:46:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:55,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-28 12:46:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:55,173 INFO L225 Difference]: With dead ends: 1116 [2018-11-28 12:46:55,173 INFO L226 Difference]: Without dead ends: 875 [2018-11-28 12:46:55,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-11-28 12:46:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2018-11-28 12:46:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-28 12:46:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1187 transitions. [2018-11-28 12:46:55,236 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1187 transitions. Word has length 54 [2018-11-28 12:46:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:55,236 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1187 transitions. [2018-11-28 12:46:55,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1187 transitions. [2018-11-28 12:46:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 12:46:55,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:55,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:55,239 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:55,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2018-11-28 12:46:55,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:55,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:55,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:55,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:55,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:55,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:55,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:46:55,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:46:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:46:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:55,294 INFO L87 Difference]: Start difference. First operand 875 states and 1187 transitions. Second operand 5 states. [2018-11-28 12:46:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:55,678 INFO L93 Difference]: Finished difference Result 885 states and 1195 transitions. [2018-11-28 12:46:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:46:55,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 12:46:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:55,681 INFO L225 Difference]: With dead ends: 885 [2018-11-28 12:46:55,681 INFO L226 Difference]: Without dead ends: 879 [2018-11-28 12:46:55,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:46:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-28 12:46:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 875. [2018-11-28 12:46:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-28 12:46:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1186 transitions. [2018-11-28 12:46:55,736 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1186 transitions. Word has length 53 [2018-11-28 12:46:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:55,737 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1186 transitions. [2018-11-28 12:46:55,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:46:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1186 transitions. [2018-11-28 12:46:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:46:55,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:55,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:55,739 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:55,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:55,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2018-11-28 12:46:55,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:55,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:55,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:55,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:55,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:55,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:55,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:46:55,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:46:55,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:46:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:55,807 INFO L87 Difference]: Start difference. First operand 875 states and 1186 transitions. Second operand 5 states. [2018-11-28 12:46:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:56,243 INFO L93 Difference]: Finished difference Result 887 states and 1197 transitions. [2018-11-28 12:46:56,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:46:56,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 12:46:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:56,247 INFO L225 Difference]: With dead ends: 887 [2018-11-28 12:46:56,247 INFO L226 Difference]: Without dead ends: 851 [2018-11-28 12:46:56,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:46:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-28 12:46:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 847. [2018-11-28 12:46:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-11-28 12:46:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1154 transitions. [2018-11-28 12:46:56,278 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1154 transitions. Word has length 52 [2018-11-28 12:46:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:56,278 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1154 transitions. [2018-11-28 12:46:56,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:46:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1154 transitions. [2018-11-28 12:46:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:46:56,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:56,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:56,281 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:56,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2018-11-28 12:46:56,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:56,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:56,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:56,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:56,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:46:56,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:46:56,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:46:56,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:56,314 INFO L87 Difference]: Start difference. First operand 847 states and 1154 transitions. Second operand 5 states. [2018-11-28 12:46:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:56,641 INFO L93 Difference]: Finished difference Result 855 states and 1160 transitions. [2018-11-28 12:46:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:46:56,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 12:46:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:56,645 INFO L225 Difference]: With dead ends: 855 [2018-11-28 12:46:56,645 INFO L226 Difference]: Without dead ends: 849 [2018-11-28 12:46:56,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:46:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-28 12:46:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2018-11-28 12:46:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-11-28 12:46:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2018-11-28 12:46:56,701 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2018-11-28 12:46:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:56,701 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2018-11-28 12:46:56,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:46:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2018-11-28 12:46:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:46:56,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:56,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] [2018-11-28 12:46:56,703 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:56,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2018-11-28 12:46:56,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:56,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:56,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:56,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:56,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:56,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:56,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:46:56,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:46:56,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:46:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:46:56,786 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 4 states. [2018-11-28 12:46:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:56,930 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2018-11-28 12:46:56,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:46:56,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-28 12:46:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:56,935 INFO L225 Difference]: With dead ends: 886 [2018-11-28 12:46:56,935 INFO L226 Difference]: Without dead ends: 854 [2018-11-28 12:46:56,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-28 12:46:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 849. [2018-11-28 12:46:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-28 12:46:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1155 transitions. [2018-11-28 12:46:56,996 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1155 transitions. Word has length 55 [2018-11-28 12:46:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:56,996 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1155 transitions. [2018-11-28 12:46:56,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:46:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1155 transitions. [2018-11-28 12:46:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:46:56,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:56,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:56,999 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:56,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2018-11-28 12:46:56,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:56,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:57,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:57,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:57,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:57,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:46:57,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:46:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:46:57,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:46:57,073 INFO L87 Difference]: Start difference. First operand 849 states and 1155 transitions. Second operand 9 states. [2018-11-28 12:46:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:57,324 INFO L93 Difference]: Finished difference Result 876 states and 1185 transitions. [2018-11-28 12:46:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:46:57,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-28 12:46:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:57,326 INFO L225 Difference]: With dead ends: 876 [2018-11-28 12:46:57,326 INFO L226 Difference]: Without dead ends: 838 [2018-11-28 12:46:57,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:46:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-28 12:46:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-28 12:46:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-28 12:46:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2018-11-28 12:46:57,357 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2018-11-28 12:46:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:57,357 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2018-11-28 12:46:57,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:46:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2018-11-28 12:46:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:46:57,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:57,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:57,360 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:57,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash 64942578, now seen corresponding path program 1 times [2018-11-28 12:46:57,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:57,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:57,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:57,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:46:57,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:46:57,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:46:57,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:46:57,435 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2018-11-28 12:46:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:57,573 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2018-11-28 12:46:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:46:57,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-28 12:46:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:57,575 INFO L225 Difference]: With dead ends: 854 [2018-11-28 12:46:57,575 INFO L226 Difference]: Without dead ends: 836 [2018-11-28 12:46:57,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:46:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-11-28 12:46:57,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2018-11-28 12:46:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-11-28 12:46:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2018-11-28 12:46:57,607 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 55 [2018-11-28 12:46:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:57,607 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2018-11-28 12:46:57,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:46:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2018-11-28 12:46:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 12:46:57,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:57,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:57,609 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:57,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash -405944758, now seen corresponding path program 1 times [2018-11-28 12:46:57,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:57,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:57,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:57,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:46:57,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:46:57,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:46:57,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:46:57,705 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2018-11-28 12:46:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:57,879 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2018-11-28 12:46:57,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:46:57,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-28 12:46:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:57,882 INFO L225 Difference]: With dead ends: 849 [2018-11-28 12:46:57,882 INFO L226 Difference]: Without dead ends: 831 [2018-11-28 12:46:57,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:46:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-28 12:46:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-11-28 12:46:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-11-28 12:46:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2018-11-28 12:46:57,935 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 56 [2018-11-28 12:46:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:57,935 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2018-11-28 12:46:57,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:46:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2018-11-28 12:46:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 12:46:57,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:57,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:57,938 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:57,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 804739700, now seen corresponding path program 1 times [2018-11-28 12:46:57,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:58,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:58,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:46:58,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:46:58,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:46:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:58,003 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2018-11-28 12:46:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:58,541 INFO L93 Difference]: Finished difference Result 1378 states and 1925 transitions. [2018-11-28 12:46:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:46:58,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-28 12:46:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:58,544 INFO L225 Difference]: With dead ends: 1378 [2018-11-28 12:46:58,544 INFO L226 Difference]: Without dead ends: 1214 [2018-11-28 12:46:58,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:46:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-11-28 12:46:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2018-11-28 12:46:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-28 12:46:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2018-11-28 12:46:58,585 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2018-11-28 12:46:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:58,585 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2018-11-28 12:46:58,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:46:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2018-11-28 12:46:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:46:58,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:58,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:58,587 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:58,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2018-11-28 12:46:58,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:58,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:58,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:58,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:46:58,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:46:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:46:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:46:58,701 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2018-11-28 12:46:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:58,857 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2018-11-28 12:46:58,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:46:58,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-28 12:46:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:58,860 INFO L225 Difference]: With dead ends: 886 [2018-11-28 12:46:58,860 INFO L226 Difference]: Without dead ends: 866 [2018-11-28 12:46:58,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:46:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-11-28 12:46:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2018-11-28 12:46:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-11-28 12:46:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2018-11-28 12:46:58,919 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2018-11-28 12:46:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:58,920 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2018-11-28 12:46:58,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:46:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2018-11-28 12:46:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 12:46:58,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:58,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:58,923 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:58,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -894292447, now seen corresponding path program 1 times [2018-11-28 12:46:58,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:58,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:58,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:59,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:59,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:46:59,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:46:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:46:59,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:46:59,046 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 12 states. [2018-11-28 12:46:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:59,231 INFO L93 Difference]: Finished difference Result 892 states and 1196 transitions. [2018-11-28 12:46:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:46:59,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-28 12:46:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:59,233 INFO L225 Difference]: With dead ends: 892 [2018-11-28 12:46:59,234 INFO L226 Difference]: Without dead ends: 867 [2018-11-28 12:46:59,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:46:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-11-28 12:46:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-11-28 12:46:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-28 12:46:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2018-11-28 12:46:59,289 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 59 [2018-11-28 12:46:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:59,289 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2018-11-28 12:46:59,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:46:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2018-11-28 12:46:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 12:46:59,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:59,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:59,294 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:59,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2018-11-28 12:46:59,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:59,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:59,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:59,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:46:59,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:46:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:46:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:59,345 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand 3 states. [2018-11-28 12:46:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:59,396 INFO L93 Difference]: Finished difference Result 899 states and 1191 transitions. [2018-11-28 12:46:59,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:46:59,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-28 12:46:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:59,399 INFO L225 Difference]: With dead ends: 899 [2018-11-28 12:46:59,400 INFO L226 Difference]: Without dead ends: 867 [2018-11-28 12:46:59,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:46:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-11-28 12:46:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-11-28 12:46:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-28 12:46:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1156 transitions. [2018-11-28 12:46:59,453 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1156 transitions. Word has length 59 [2018-11-28 12:46:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:59,453 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1156 transitions. [2018-11-28 12:46:59,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:46:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1156 transitions. [2018-11-28 12:46:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 12:46:59,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:59,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:59,455 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:59,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2018-11-28 12:46:59,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:59,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:59,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:59,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:46:59,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:46:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:46:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:46:59,509 INFO L87 Difference]: Start difference. First operand 865 states and 1156 transitions. Second operand 9 states. [2018-11-28 12:46:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:59,713 INFO L93 Difference]: Finished difference Result 887 states and 1179 transitions. [2018-11-28 12:46:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:46:59,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-28 12:46:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:59,715 INFO L225 Difference]: With dead ends: 887 [2018-11-28 12:46:59,715 INFO L226 Difference]: Without dead ends: 853 [2018-11-28 12:46:59,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:46:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-28 12:46:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2018-11-28 12:46:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-11-28 12:46:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1136 transitions. [2018-11-28 12:46:59,749 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1136 transitions. Word has length 59 [2018-11-28 12:46:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:59,749 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1136 transitions. [2018-11-28 12:46:59,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:46:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1136 transitions. [2018-11-28 12:46:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 12:46:59,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:59,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:59,751 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:59,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2018-11-28 12:46:59,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:59,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:59,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:59,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:59,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:59,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:46:59,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:46:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:46:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:46:59,783 INFO L87 Difference]: Start difference. First operand 853 states and 1136 transitions. Second operand 4 states. [2018-11-28 12:46:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:46:59,876 INFO L93 Difference]: Finished difference Result 1009 states and 1359 transitions. [2018-11-28 12:46:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:46:59,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 12:46:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:46:59,879 INFO L225 Difference]: With dead ends: 1009 [2018-11-28 12:46:59,880 INFO L226 Difference]: Without dead ends: 898 [2018-11-28 12:46:59,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:46:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-11-28 12:46:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 860. [2018-11-28 12:46:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-11-28 12:46:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1152 transitions. [2018-11-28 12:46:59,916 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1152 transitions. Word has length 60 [2018-11-28 12:46:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:46:59,916 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1152 transitions. [2018-11-28 12:46:59,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:46:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1152 transitions. [2018-11-28 12:46:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 12:46:59,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:46:59,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:46:59,919 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:46:59,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:46:59,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2018-11-28 12:46:59,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:46:59,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:46:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:46:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:46:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:46:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:46:59,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:46:59,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:46:59,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:46:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:46:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:46:59,997 INFO L87 Difference]: Start difference. First operand 860 states and 1152 transitions. Second operand 11 states. [2018-11-28 12:47:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:00,128 INFO L93 Difference]: Finished difference Result 929 states and 1245 transitions. [2018-11-28 12:47:00,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:00,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-28 12:47:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:00,132 INFO L225 Difference]: With dead ends: 929 [2018-11-28 12:47:00,132 INFO L226 Difference]: Without dead ends: 874 [2018-11-28 12:47:00,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-28 12:47:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 864. [2018-11-28 12:47:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-11-28 12:47:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1170 transitions. [2018-11-28 12:47:00,196 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1170 transitions. Word has length 60 [2018-11-28 12:47:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:00,196 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1170 transitions. [2018-11-28 12:47:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1170 transitions. [2018-11-28 12:47:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 12:47:00,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:00,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:00,199 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:00,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2018-11-28 12:47:00,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:00,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:00,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:00,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:00,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:47:00,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:47:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:47:00,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:47:00,271 INFO L87 Difference]: Start difference. First operand 864 states and 1170 transitions. Second operand 9 states. [2018-11-28 12:47:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:00,485 INFO L93 Difference]: Finished difference Result 895 states and 1207 transitions. [2018-11-28 12:47:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:47:00,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-28 12:47:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:00,489 INFO L225 Difference]: With dead ends: 895 [2018-11-28 12:47:00,489 INFO L226 Difference]: Without dead ends: 856 [2018-11-28 12:47:00,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-28 12:47:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-28 12:47:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-28 12:47:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-11-28 12:47:00,545 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 60 [2018-11-28 12:47:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:00,545 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-11-28 12:47:00,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:47:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-11-28 12:47:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:00,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:00,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:00,547 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:00,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:00,548 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2018-11-28 12:47:00,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:00,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:00,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:00,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:00,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 12:47:00,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:47:00,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:47:00,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:00,719 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 13 states. [2018-11-28 12:47:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:00,978 INFO L93 Difference]: Finished difference Result 873 states and 1172 transitions. [2018-11-28 12:47:00,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:47:00,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-28 12:47:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:00,980 INFO L225 Difference]: With dead ends: 873 [2018-11-28 12:47:00,980 INFO L226 Difference]: Without dead ends: 845 [2018-11-28 12:47:00,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:47:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-11-28 12:47:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-11-28 12:47:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-11-28 12:47:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2018-11-28 12:47:01,022 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 69 [2018-11-28 12:47:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:01,023 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2018-11-28 12:47:01,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:47:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2018-11-28 12:47:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 12:47:01,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:01,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:01,024 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:01,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2018-11-28 12:47:01,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:01,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:01,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:01,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 12:47:01,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:47:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:47:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:01,185 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 13 states. [2018-11-28 12:47:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:01,413 INFO L93 Difference]: Finished difference Result 862 states and 1157 transitions. [2018-11-28 12:47:01,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:47:01,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-28 12:47:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:01,416 INFO L225 Difference]: With dead ends: 862 [2018-11-28 12:47:01,416 INFO L226 Difference]: Without dead ends: 840 [2018-11-28 12:47:01,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:47:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-28 12:47:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2018-11-28 12:47:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-28 12:47:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1132 transitions. [2018-11-28 12:47:01,466 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1132 transitions. Word has length 62 [2018-11-28 12:47:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:01,466 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1132 transitions. [2018-11-28 12:47:01,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:47:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1132 transitions. [2018-11-28 12:47:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 12:47:01,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:01,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:01,469 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:01,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2018-11-28 12:47:01,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:01,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:01,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:01,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:47:01,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:47:01,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:47:01,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:01,517 INFO L87 Difference]: Start difference. First operand 840 states and 1132 transitions. Second operand 3 states. [2018-11-28 12:47:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:01,567 INFO L93 Difference]: Finished difference Result 1113 states and 1501 transitions. [2018-11-28 12:47:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:47:01,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-28 12:47:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:01,570 INFO L225 Difference]: With dead ends: 1113 [2018-11-28 12:47:01,570 INFO L226 Difference]: Without dead ends: 779 [2018-11-28 12:47:01,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-28 12:47:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 730. [2018-11-28 12:47:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-28 12:47:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 949 transitions. [2018-11-28 12:47:01,606 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 949 transitions. Word has length 62 [2018-11-28 12:47:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:01,606 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 949 transitions. [2018-11-28 12:47:01,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:47:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 949 transitions. [2018-11-28 12:47:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 12:47:01,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:01,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:01,608 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:01,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:01,608 INFO L82 PathProgramCache]: Analyzing trace with hash -930632011, now seen corresponding path program 1 times [2018-11-28 12:47:01,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:01,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:01,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:01,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:01,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:01,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:47:01,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:47:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:47:01,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:47:01,697 INFO L87 Difference]: Start difference. First operand 730 states and 949 transitions. Second operand 12 states. [2018-11-28 12:47:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:01,842 INFO L93 Difference]: Finished difference Result 752 states and 972 transitions. [2018-11-28 12:47:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:47:01,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-28 12:47:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:01,845 INFO L225 Difference]: With dead ends: 752 [2018-11-28 12:47:01,845 INFO L226 Difference]: Without dead ends: 728 [2018-11-28 12:47:01,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:47:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-11-28 12:47:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-11-28 12:47:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-11-28 12:47:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 945 transitions. [2018-11-28 12:47:01,894 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 945 transitions. Word has length 63 [2018-11-28 12:47:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:01,894 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 945 transitions. [2018-11-28 12:47:01,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:47:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 945 transitions. [2018-11-28 12:47:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 12:47:01,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:01,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:01,896 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:01,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 111591861, now seen corresponding path program 1 times [2018-11-28 12:47:01,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:01,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:01,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:01,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:01,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:01,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:01,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:01,944 INFO L87 Difference]: Start difference. First operand 728 states and 945 transitions. Second operand 5 states. [2018-11-28 12:47:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:02,035 INFO L93 Difference]: Finished difference Result 763 states and 986 transitions. [2018-11-28 12:47:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:02,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 12:47:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:02,038 INFO L225 Difference]: With dead ends: 763 [2018-11-28 12:47:02,038 INFO L226 Difference]: Without dead ends: 735 [2018-11-28 12:47:02,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-11-28 12:47:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2018-11-28 12:47:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-28 12:47:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 953 transitions. [2018-11-28 12:47:02,078 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 953 transitions. Word has length 67 [2018-11-28 12:47:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:02,078 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 953 transitions. [2018-11-28 12:47:02,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 953 transitions. [2018-11-28 12:47:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 12:47:02,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:02,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:02,080 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:02,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1932048657, now seen corresponding path program 1 times [2018-11-28 12:47:02,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:02,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:02,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:02,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:02,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:47:02,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:47:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:47:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:47:02,162 INFO L87 Difference]: Start difference. First operand 733 states and 953 transitions. Second operand 12 states. [2018-11-28 12:47:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:02,304 INFO L93 Difference]: Finished difference Result 757 states and 978 transitions. [2018-11-28 12:47:02,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:47:02,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-28 12:47:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:02,307 INFO L225 Difference]: With dead ends: 757 [2018-11-28 12:47:02,307 INFO L226 Difference]: Without dead ends: 733 [2018-11-28 12:47:02,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:47:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-28 12:47:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2018-11-28 12:47:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-11-28 12:47:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 949 transitions. [2018-11-28 12:47:02,343 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 949 transitions. Word has length 62 [2018-11-28 12:47:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:02,343 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 949 transitions. [2018-11-28 12:47:02,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:47:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 949 transitions. [2018-11-28 12:47:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 12:47:02,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:02,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:02,345 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:02,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2018-11-28 12:47:02,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:02,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:02,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:02,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 12:47:02,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:47:02,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:47:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:02,464 INFO L87 Difference]: Start difference. First operand 731 states and 949 transitions. Second operand 13 states. [2018-11-28 12:47:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:02,618 INFO L93 Difference]: Finished difference Result 751 states and 970 transitions. [2018-11-28 12:47:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:47:02,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-28 12:47:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:02,620 INFO L225 Difference]: With dead ends: 751 [2018-11-28 12:47:02,620 INFO L226 Difference]: Without dead ends: 729 [2018-11-28 12:47:02,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:47:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-11-28 12:47:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2018-11-28 12:47:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-11-28 12:47:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 945 transitions. [2018-11-28 12:47:02,669 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 945 transitions. Word has length 72 [2018-11-28 12:47:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:02,669 INFO L480 AbstractCegarLoop]: Abstraction has 729 states and 945 transitions. [2018-11-28 12:47:02,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:47:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 945 transitions. [2018-11-28 12:47:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 12:47:02,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:02,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:02,671 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:02,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2018-11-28 12:47:02,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:02,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:02,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:02,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 12:47:02,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:47:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:47:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:02,821 INFO L87 Difference]: Start difference. First operand 729 states and 945 transitions. Second operand 13 states. [2018-11-28 12:47:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:03,019 INFO L93 Difference]: Finished difference Result 746 states and 963 transitions. [2018-11-28 12:47:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:47:03,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-28 12:47:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:03,021 INFO L225 Difference]: With dead ends: 746 [2018-11-28 12:47:03,022 INFO L226 Difference]: Without dead ends: 724 [2018-11-28 12:47:03,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:47:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-11-28 12:47:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-11-28 12:47:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-28 12:47:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 938 transitions. [2018-11-28 12:47:03,065 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 938 transitions. Word has length 63 [2018-11-28 12:47:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:03,066 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 938 transitions. [2018-11-28 12:47:03,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:47:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 938 transitions. [2018-11-28 12:47:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 12:47:03,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:03,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:03,067 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:03,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1755012540, now seen corresponding path program 1 times [2018-11-28 12:47:03,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:03,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:03,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:03,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:47:03,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:47:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:47:03,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:03,096 INFO L87 Difference]: Start difference. First operand 724 states and 938 transitions. Second operand 3 states. [2018-11-28 12:47:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:03,125 INFO L93 Difference]: Finished difference Result 854 states and 1111 transitions. [2018-11-28 12:47:03,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:47:03,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 12:47:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:03,128 INFO L225 Difference]: With dead ends: 854 [2018-11-28 12:47:03,128 INFO L226 Difference]: Without dead ends: 724 [2018-11-28 12:47:03,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-11-28 12:47:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-11-28 12:47:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-28 12:47:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 935 transitions. [2018-11-28 12:47:03,157 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 935 transitions. Word has length 66 [2018-11-28 12:47:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:03,157 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 935 transitions. [2018-11-28 12:47:03,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:47:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 935 transitions. [2018-11-28 12:47:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 12:47:03,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:03,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:03,158 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:03,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash -154169194, now seen corresponding path program 1 times [2018-11-28 12:47:03,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:03,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:03,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:03,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:03,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:03,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:03,225 INFO L87 Difference]: Start difference. First operand 724 states and 935 transitions. Second operand 5 states. [2018-11-28 12:47:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:03,551 INFO L93 Difference]: Finished difference Result 971 states and 1246 transitions. [2018-11-28 12:47:03,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:03,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 12:47:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:03,554 INFO L225 Difference]: With dead ends: 971 [2018-11-28 12:47:03,554 INFO L226 Difference]: Without dead ends: 834 [2018-11-28 12:47:03,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:47:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-11-28 12:47:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 765. [2018-11-28 12:47:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-11-28 12:47:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 986 transitions. [2018-11-28 12:47:03,588 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 986 transitions. Word has length 67 [2018-11-28 12:47:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:03,589 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 986 transitions. [2018-11-28 12:47:03,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 986 transitions. [2018-11-28 12:47:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:47:03,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:03,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:03,590 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:03,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2018-11-28 12:47:03,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:03,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:03,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:03,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:03,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:03,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:03,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:03,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:03,625 INFO L87 Difference]: Start difference. First operand 765 states and 986 transitions. Second operand 5 states. [2018-11-28 12:47:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:03,688 INFO L93 Difference]: Finished difference Result 819 states and 1045 transitions. [2018-11-28 12:47:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:03,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 12:47:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:03,690 INFO L225 Difference]: With dead ends: 819 [2018-11-28 12:47:03,690 INFO L226 Difference]: Without dead ends: 767 [2018-11-28 12:47:03,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-11-28 12:47:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2018-11-28 12:47:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-11-28 12:47:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 985 transitions. [2018-11-28 12:47:03,728 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 985 transitions. Word has length 65 [2018-11-28 12:47:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:03,728 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 985 transitions. [2018-11-28 12:47:03,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 985 transitions. [2018-11-28 12:47:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:47:03,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:03,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:03,730 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:03,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash 21902732, now seen corresponding path program 1 times [2018-11-28 12:47:03,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:03,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:03,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:03,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:03,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:03,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:03,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:03,785 INFO L87 Difference]: Start difference. First operand 765 states and 985 transitions. Second operand 5 states. [2018-11-28 12:47:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:03,899 INFO L93 Difference]: Finished difference Result 829 states and 1060 transitions. [2018-11-28 12:47:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:03,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 12:47:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:03,902 INFO L225 Difference]: With dead ends: 829 [2018-11-28 12:47:03,902 INFO L226 Difference]: Without dead ends: 796 [2018-11-28 12:47:03,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-11-28 12:47:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 771. [2018-11-28 12:47:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-11-28 12:47:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 992 transitions. [2018-11-28 12:47:03,940 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 992 transitions. Word has length 65 [2018-11-28 12:47:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:03,940 INFO L480 AbstractCegarLoop]: Abstraction has 771 states and 992 transitions. [2018-11-28 12:47:03,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 992 transitions. [2018-11-28 12:47:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 12:47:03,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:03,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:03,942 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:03,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash -900473525, now seen corresponding path program 1 times [2018-11-28 12:47:03,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:03,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:04,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:04,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:47:04,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:47:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:47:04,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:47:04,037 INFO L87 Difference]: Start difference. First operand 771 states and 992 transitions. Second operand 12 states. [2018-11-28 12:47:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:04,160 INFO L93 Difference]: Finished difference Result 794 states and 1016 transitions. [2018-11-28 12:47:04,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:47:04,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-28 12:47:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:04,163 INFO L225 Difference]: With dead ends: 794 [2018-11-28 12:47:04,163 INFO L226 Difference]: Without dead ends: 771 [2018-11-28 12:47:04,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:47:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-11-28 12:47:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2018-11-28 12:47:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-11-28 12:47:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 991 transitions. [2018-11-28 12:47:04,221 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 991 transitions. Word has length 70 [2018-11-28 12:47:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:04,221 INFO L480 AbstractCegarLoop]: Abstraction has 771 states and 991 transitions. [2018-11-28 12:47:04,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:47:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 991 transitions. [2018-11-28 12:47:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 12:47:04,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:04,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:04,223 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:04,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1253285750, now seen corresponding path program 1 times [2018-11-28 12:47:04,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:04,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:04,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:04,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:04,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:04,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:04,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:47:04,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:47:04,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:47:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:47:04,320 INFO L87 Difference]: Start difference. First operand 771 states and 991 transitions. Second operand 12 states. [2018-11-28 12:47:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:04,497 INFO L93 Difference]: Finished difference Result 795 states and 1016 transitions. [2018-11-28 12:47:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:47:04,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-28 12:47:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:04,499 INFO L225 Difference]: With dead ends: 795 [2018-11-28 12:47:04,499 INFO L226 Difference]: Without dead ends: 771 [2018-11-28 12:47:04,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:47:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-11-28 12:47:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2018-11-28 12:47:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-11-28 12:47:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 987 transitions. [2018-11-28 12:47:04,539 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 987 transitions. Word has length 66 [2018-11-28 12:47:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:04,539 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 987 transitions. [2018-11-28 12:47:04,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:47:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 987 transitions. [2018-11-28 12:47:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 12:47:04,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:04,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:04,541 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:04,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:04,541 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2018-11-28 12:47:04,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:04,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:04,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:04,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:04,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:04,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:04,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:04,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:04,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:04,633 INFO L87 Difference]: Start difference. First operand 769 states and 987 transitions. Second operand 11 states. [2018-11-28 12:47:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:04,729 INFO L93 Difference]: Finished difference Result 791 states and 1010 transitions. [2018-11-28 12:47:04,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:04,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-28 12:47:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:04,731 INFO L225 Difference]: With dead ends: 791 [2018-11-28 12:47:04,731 INFO L226 Difference]: Without dead ends: 765 [2018-11-28 12:47:04,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-28 12:47:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 759. [2018-11-28 12:47:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-28 12:47:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 973 transitions. [2018-11-28 12:47:04,768 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 973 transitions. Word has length 66 [2018-11-28 12:47:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:04,768 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 973 transitions. [2018-11-28 12:47:04,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 973 transitions. [2018-11-28 12:47:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 12:47:04,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:04,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:04,769 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:04,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash -198873651, now seen corresponding path program 1 times [2018-11-28 12:47:04,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:04,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:04,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:04,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:47:04,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:47:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:47:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:47:04,868 INFO L87 Difference]: Start difference. First operand 759 states and 973 transitions. Second operand 14 states. [2018-11-28 12:47:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:05,060 INFO L93 Difference]: Finished difference Result 785 states and 1001 transitions. [2018-11-28 12:47:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:47:05,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-28 12:47:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:05,062 INFO L225 Difference]: With dead ends: 785 [2018-11-28 12:47:05,062 INFO L226 Difference]: Without dead ends: 757 [2018-11-28 12:47:05,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:47:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-11-28 12:47:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 755. [2018-11-28 12:47:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-11-28 12:47:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 967 transitions. [2018-11-28 12:47:05,115 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 967 transitions. Word has length 70 [2018-11-28 12:47:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:05,115 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 967 transitions. [2018-11-28 12:47:05,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:47:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 967 transitions. [2018-11-28 12:47:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 12:47:05,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:05,116 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:05,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:05,117 INFO L82 PathProgramCache]: Analyzing trace with hash 813191735, now seen corresponding path program 1 times [2018-11-28 12:47:05,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:05,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:05,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:05,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:05,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:05,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:47:05,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:47:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:47:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:47:05,194 INFO L87 Difference]: Start difference. First operand 755 states and 967 transitions. Second operand 12 states. [2018-11-28 12:47:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:05,314 INFO L93 Difference]: Finished difference Result 777 states and 990 transitions. [2018-11-28 12:47:05,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:47:05,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-28 12:47:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:05,316 INFO L225 Difference]: With dead ends: 777 [2018-11-28 12:47:05,316 INFO L226 Difference]: Without dead ends: 753 [2018-11-28 12:47:05,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:47:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-11-28 12:47:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-11-28 12:47:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-28 12:47:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 963 transitions. [2018-11-28 12:47:05,350 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 963 transitions. Word has length 67 [2018-11-28 12:47:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:05,351 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 963 transitions. [2018-11-28 12:47:05,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:47:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 963 transitions. [2018-11-28 12:47:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 12:47:05,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:05,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:05,352 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:05,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2018-11-28 12:47:05,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:05,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:05,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:05,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:05,401 INFO L87 Difference]: Start difference. First operand 753 states and 963 transitions. Second operand 5 states. [2018-11-28 12:47:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:05,454 INFO L93 Difference]: Finished difference Result 794 states and 1007 transitions. [2018-11-28 12:47:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:05,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 12:47:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:05,457 INFO L225 Difference]: With dead ends: 794 [2018-11-28 12:47:05,457 INFO L226 Difference]: Without dead ends: 760 [2018-11-28 12:47:05,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-11-28 12:47:05,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 753. [2018-11-28 12:47:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-28 12:47:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 962 transitions. [2018-11-28 12:47:05,490 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 962 transitions. Word has length 67 [2018-11-28 12:47:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:05,490 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 962 transitions. [2018-11-28 12:47:05,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 962 transitions. [2018-11-28 12:47:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:47:05,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:05,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:05,491 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:05,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:05,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2018-11-28 12:47:05,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:05,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:05,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:05,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:05,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:05,543 INFO L87 Difference]: Start difference. First operand 753 states and 962 transitions. Second operand 6 states. [2018-11-28 12:47:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:05,615 INFO L93 Difference]: Finished difference Result 792 states and 1003 transitions. [2018-11-28 12:47:05,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:05,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 12:47:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:05,618 INFO L225 Difference]: With dead ends: 792 [2018-11-28 12:47:05,618 INFO L226 Difference]: Without dead ends: 760 [2018-11-28 12:47:05,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-11-28 12:47:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 755. [2018-11-28 12:47:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-11-28 12:47:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 964 transitions. [2018-11-28 12:47:05,667 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 964 transitions. Word has length 68 [2018-11-28 12:47:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:05,667 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 964 transitions. [2018-11-28 12:47:05,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 964 transitions. [2018-11-28 12:47:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:47:05,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:05,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:05,668 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:05,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:05,669 INFO L82 PathProgramCache]: Analyzing trace with hash 810473489, now seen corresponding path program 1 times [2018-11-28 12:47:05,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:05,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:05,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:05,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:05,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:05,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:05,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:05,730 INFO L87 Difference]: Start difference. First operand 755 states and 964 transitions. Second operand 11 states. [2018-11-28 12:47:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:05,835 INFO L93 Difference]: Finished difference Result 780 states and 991 transitions. [2018-11-28 12:47:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:05,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-28 12:47:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:05,836 INFO L225 Difference]: With dead ends: 780 [2018-11-28 12:47:05,837 INFO L226 Difference]: Without dead ends: 747 [2018-11-28 12:47:05,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-11-28 12:47:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2018-11-28 12:47:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-11-28 12:47:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 954 transitions. [2018-11-28 12:47:05,868 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 954 transitions. Word has length 68 [2018-11-28 12:47:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:05,868 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 954 transitions. [2018-11-28 12:47:05,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 954 transitions. [2018-11-28 12:47:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:47:05,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:05,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:05,870 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:05,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2018-11-28 12:47:05,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:05,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:05,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:05,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:05,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:05,932 INFO L87 Difference]: Start difference. First operand 747 states and 954 transitions. Second operand 6 states. [2018-11-28 12:47:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:06,024 INFO L93 Difference]: Finished difference Result 794 states and 1002 transitions. [2018-11-28 12:47:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:06,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 12:47:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:06,028 INFO L225 Difference]: With dead ends: 794 [2018-11-28 12:47:06,029 INFO L226 Difference]: Without dead ends: 742 [2018-11-28 12:47:06,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-11-28 12:47:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2018-11-28 12:47:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-28 12:47:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 941 transitions. [2018-11-28 12:47:06,066 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 941 transitions. Word has length 68 [2018-11-28 12:47:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 941 transitions. [2018-11-28 12:47:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 941 transitions. [2018-11-28 12:47:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:47:06,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:06,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:06,067 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash 631462302, now seen corresponding path program 1 times [2018-11-28 12:47:06,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:06,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:06,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:06,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:06,119 INFO L87 Difference]: Start difference. First operand 740 states and 941 transitions. Second operand 11 states. [2018-11-28 12:47:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:06,195 INFO L93 Difference]: Finished difference Result 762 states and 964 transitions. [2018-11-28 12:47:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:06,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-28 12:47:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:06,196 INFO L225 Difference]: With dead ends: 762 [2018-11-28 12:47:06,197 INFO L226 Difference]: Without dead ends: 730 [2018-11-28 12:47:06,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-28 12:47:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-11-28 12:47:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-28 12:47:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 927 transitions. [2018-11-28 12:47:06,226 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 927 transitions. Word has length 68 [2018-11-28 12:47:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:06,226 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 927 transitions. [2018-11-28 12:47:06,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 927 transitions. [2018-11-28 12:47:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:47:06,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:06,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:06,227 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:06,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:06,227 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2018-11-28 12:47:06,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:06,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:06,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:06,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:06,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:06,251 INFO L87 Difference]: Start difference. First operand 730 states and 927 transitions. Second operand 5 states. [2018-11-28 12:47:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:06,483 INFO L93 Difference]: Finished difference Result 791 states and 1006 transitions. [2018-11-28 12:47:06,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:06,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 12:47:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:06,484 INFO L225 Difference]: With dead ends: 791 [2018-11-28 12:47:06,484 INFO L226 Difference]: Without dead ends: 785 [2018-11-28 12:47:06,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-28 12:47:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 730. [2018-11-28 12:47:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-28 12:47:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 926 transitions. [2018-11-28 12:47:06,523 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 926 transitions. Word has length 68 [2018-11-28 12:47:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:06,523 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 926 transitions. [2018-11-28 12:47:06,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 926 transitions. [2018-11-28 12:47:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:06,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:06,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:06,525 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:06,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2018-11-28 12:47:06,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:06,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:06,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:06,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:06,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:06,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:06,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:06,562 INFO L87 Difference]: Start difference. First operand 730 states and 926 transitions. Second operand 5 states. [2018-11-28 12:47:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:06,628 INFO L93 Difference]: Finished difference Result 771 states and 970 transitions. [2018-11-28 12:47:06,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:06,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 12:47:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:06,630 INFO L225 Difference]: With dead ends: 771 [2018-11-28 12:47:06,630 INFO L226 Difference]: Without dead ends: 737 [2018-11-28 12:47:06,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-28 12:47:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 730. [2018-11-28 12:47:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-28 12:47:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 925 transitions. [2018-11-28 12:47:06,668 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 925 transitions. Word has length 69 [2018-11-28 12:47:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:06,668 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 925 transitions. [2018-11-28 12:47:06,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 925 transitions. [2018-11-28 12:47:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:06,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:06,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:06,670 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:06,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2018-11-28 12:47:06,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:06,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:06,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:06,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:06,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:06,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:06,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:06,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:06,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:06,722 INFO L87 Difference]: Start difference. First operand 730 states and 925 transitions. Second operand 6 states. [2018-11-28 12:47:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:06,796 INFO L93 Difference]: Finished difference Result 769 states and 966 transitions. [2018-11-28 12:47:06,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:06,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 12:47:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:06,798 INFO L225 Difference]: With dead ends: 769 [2018-11-28 12:47:06,798 INFO L226 Difference]: Without dead ends: 737 [2018-11-28 12:47:06,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-28 12:47:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 732. [2018-11-28 12:47:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-11-28 12:47:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 927 transitions. [2018-11-28 12:47:06,852 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 927 transitions. Word has length 69 [2018-11-28 12:47:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:06,852 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 927 transitions. [2018-11-28 12:47:06,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 927 transitions. [2018-11-28 12:47:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:06,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:06,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:06,853 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:06,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2052556264, now seen corresponding path program 1 times [2018-11-28 12:47:06,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:06,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:06,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:06,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:06,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:06,920 INFO L87 Difference]: Start difference. First operand 732 states and 927 transitions. Second operand 11 states. [2018-11-28 12:47:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:07,019 INFO L93 Difference]: Finished difference Result 757 states and 954 transitions. [2018-11-28 12:47:07,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:07,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-28 12:47:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:07,021 INFO L225 Difference]: With dead ends: 757 [2018-11-28 12:47:07,021 INFO L226 Difference]: Without dead ends: 725 [2018-11-28 12:47:07,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-28 12:47:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-11-28 12:47:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-28 12:47:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 918 transitions. [2018-11-28 12:47:07,059 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 918 transitions. Word has length 69 [2018-11-28 12:47:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:07,059 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 918 transitions. [2018-11-28 12:47:07,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 918 transitions. [2018-11-28 12:47:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:07,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:07,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:07,061 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:07,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2018-11-28 12:47:07,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:07,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:07,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:07,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:07,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:07,115 INFO L87 Difference]: Start difference. First operand 725 states and 918 transitions. Second operand 6 states. [2018-11-28 12:47:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:07,185 INFO L93 Difference]: Finished difference Result 764 states and 959 transitions. [2018-11-28 12:47:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:07,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 12:47:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:07,186 INFO L225 Difference]: With dead ends: 764 [2018-11-28 12:47:07,186 INFO L226 Difference]: Without dead ends: 732 [2018-11-28 12:47:07,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-28 12:47:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 727. [2018-11-28 12:47:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-28 12:47:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 920 transitions. [2018-11-28 12:47:07,225 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 920 transitions. Word has length 69 [2018-11-28 12:47:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:07,225 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 920 transitions. [2018-11-28 12:47:07,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 920 transitions. [2018-11-28 12:47:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:07,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:07,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:07,226 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:07,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1860763099, now seen corresponding path program 1 times [2018-11-28 12:47:07,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:07,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:07,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:07,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:07,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:07,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:07,300 INFO L87 Difference]: Start difference. First operand 727 states and 920 transitions. Second operand 11 states. [2018-11-28 12:47:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:07,403 INFO L93 Difference]: Finished difference Result 752 states and 947 transitions. [2018-11-28 12:47:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:07,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-28 12:47:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:07,405 INFO L225 Difference]: With dead ends: 752 [2018-11-28 12:47:07,405 INFO L226 Difference]: Without dead ends: 722 [2018-11-28 12:47:07,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-28 12:47:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2018-11-28 12:47:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-11-28 12:47:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 913 transitions. [2018-11-28 12:47:07,445 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 913 transitions. Word has length 69 [2018-11-28 12:47:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:07,445 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 913 transitions. [2018-11-28 12:47:07,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 913 transitions. [2018-11-28 12:47:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:07,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:07,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:07,447 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:07,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2018-11-28 12:47:07,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:07,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:07,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:07,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:07,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:07,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:07,537 INFO L87 Difference]: Start difference. First operand 722 states and 913 transitions. Second operand 11 states. [2018-11-28 12:47:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:07,679 INFO L93 Difference]: Finished difference Result 732 states and 922 transitions. [2018-11-28 12:47:07,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:07,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-28 12:47:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:07,681 INFO L225 Difference]: With dead ends: 732 [2018-11-28 12:47:07,681 INFO L226 Difference]: Without dead ends: 726 [2018-11-28 12:47:07,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-11-28 12:47:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 720. [2018-11-28 12:47:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-11-28 12:47:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 909 transitions. [2018-11-28 12:47:07,719 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 909 transitions. Word has length 69 [2018-11-28 12:47:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:07,719 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 909 transitions. [2018-11-28 12:47:07,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 909 transitions. [2018-11-28 12:47:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:47:07,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:07,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:07,720 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:07,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2018-11-28 12:47:07,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:07,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:07,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:07,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:07,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:07,763 INFO L87 Difference]: Start difference. First operand 720 states and 909 transitions. Second operand 5 states. [2018-11-28 12:47:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:08,032 INFO L93 Difference]: Finished difference Result 777 states and 984 transitions. [2018-11-28 12:47:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:08,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 12:47:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:08,034 INFO L225 Difference]: With dead ends: 777 [2018-11-28 12:47:08,034 INFO L226 Difference]: Without dead ends: 715 [2018-11-28 12:47:08,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-28 12:47:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 664. [2018-11-28 12:47:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-11-28 12:47:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 838 transitions. [2018-11-28 12:47:08,070 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 838 transitions. Word has length 69 [2018-11-28 12:47:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:08,070 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 838 transitions. [2018-11-28 12:47:08,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 838 transitions. [2018-11-28 12:47:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 12:47:08,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:08,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:08,071 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:08,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash 459038371, now seen corresponding path program 1 times [2018-11-28 12:47:08,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:08,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:08,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:08,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:08,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-11-28 12:47:08,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:08,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:47:08,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:47:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:47:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:08,154 INFO L87 Difference]: Start difference. First operand 664 states and 838 transitions. Second operand 7 states. [2018-11-28 12:47:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:08,247 INFO L93 Difference]: Finished difference Result 710 states and 885 transitions. [2018-11-28 12:47:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:47:08,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-28 12:47:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:08,249 INFO L225 Difference]: With dead ends: 710 [2018-11-28 12:47:08,249 INFO L226 Difference]: Without dead ends: 665 [2018-11-28 12:47:08,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:47:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-11-28 12:47:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2018-11-28 12:47:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-11-28 12:47:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 834 transitions. [2018-11-28 12:47:08,287 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 834 transitions. Word has length 74 [2018-11-28 12:47:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:08,288 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 834 transitions. [2018-11-28 12:47:08,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:47:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 834 transitions. [2018-11-28 12:47:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 12:47:08,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:08,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:08,290 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:08,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1160638245, now seen corresponding path program 1 times [2018-11-28 12:47:08,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:08,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:08,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:47:08,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:47:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:47:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:47:08,370 INFO L87 Difference]: Start difference. First operand 663 states and 834 transitions. Second operand 14 states. [2018-11-28 12:47:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:08,530 INFO L93 Difference]: Finished difference Result 685 states and 857 transitions. [2018-11-28 12:47:08,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:47:08,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-28 12:47:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:08,532 INFO L225 Difference]: With dead ends: 685 [2018-11-28 12:47:08,532 INFO L226 Difference]: Without dead ends: 653 [2018-11-28 12:47:08,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:47:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-28 12:47:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2018-11-28 12:47:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-28 12:47:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 819 transitions. [2018-11-28 12:47:08,585 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 819 transitions. Word has length 74 [2018-11-28 12:47:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:08,585 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 819 transitions. [2018-11-28 12:47:08,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:47:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 819 transitions. [2018-11-28 12:47:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:47:08,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:08,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:08,587 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:08,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1712334254, now seen corresponding path program 1 times [2018-11-28 12:47:08,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:08,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:08,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:08,622 INFO L87 Difference]: Start difference. First operand 653 states and 819 transitions. Second operand 5 states. [2018-11-28 12:47:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:08,698 INFO L93 Difference]: Finished difference Result 700 states and 868 transitions. [2018-11-28 12:47:08,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:08,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-28 12:47:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:08,699 INFO L225 Difference]: With dead ends: 700 [2018-11-28 12:47:08,699 INFO L226 Difference]: Without dead ends: 657 [2018-11-28 12:47:08,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-28 12:47:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2018-11-28 12:47:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-28 12:47:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 818 transitions. [2018-11-28 12:47:08,738 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 818 transitions. Word has length 71 [2018-11-28 12:47:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:08,738 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 818 transitions. [2018-11-28 12:47:08,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 818 transitions. [2018-11-28 12:47:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:47:08,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:08,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:08,739 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:08,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash -531649044, now seen corresponding path program 1 times [2018-11-28 12:47:08,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:08,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:08,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:08,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:47:08,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:47:08,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:47:08,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:47:08,839 INFO L87 Difference]: Start difference. First operand 653 states and 818 transitions. Second operand 14 states. [2018-11-28 12:47:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:08,960 INFO L93 Difference]: Finished difference Result 677 states and 844 transitions. [2018-11-28 12:47:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:47:08,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-28 12:47:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:08,961 INFO L225 Difference]: With dead ends: 677 [2018-11-28 12:47:08,961 INFO L226 Difference]: Without dead ends: 646 [2018-11-28 12:47:08,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:47:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-28 12:47:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2018-11-28 12:47:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-28 12:47:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 808 transitions. [2018-11-28 12:47:08,990 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 808 transitions. Word has length 71 [2018-11-28 12:47:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:08,990 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 808 transitions. [2018-11-28 12:47:08,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:47:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 808 transitions. [2018-11-28 12:47:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:47:08,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:08,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:08,991 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:08,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906513, now seen corresponding path program 1 times [2018-11-28 12:47:08,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:08,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:09,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:09,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:47:09,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:47:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:47:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:47:09,070 INFO L87 Difference]: Start difference. First operand 646 states and 808 transitions. Second operand 14 states. [2018-11-28 12:47:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:09,190 INFO L93 Difference]: Finished difference Result 710 states and 876 transitions. [2018-11-28 12:47:09,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:47:09,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-28 12:47:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:09,192 INFO L225 Difference]: With dead ends: 710 [2018-11-28 12:47:09,192 INFO L226 Difference]: Without dead ends: 640 [2018-11-28 12:47:09,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:47:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-11-28 12:47:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2018-11-28 12:47:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-28 12:47:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 799 transitions. [2018-11-28 12:47:09,228 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 799 transitions. Word has length 71 [2018-11-28 12:47:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:09,228 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 799 transitions. [2018-11-28 12:47:09,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:47:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 799 transitions. [2018-11-28 12:47:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 12:47:09,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:09,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:09,229 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:09,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2018-11-28 12:47:09,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:09,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:09,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:09,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:09,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:09,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:09,282 INFO L87 Difference]: Start difference. First operand 640 states and 799 transitions. Second operand 11 states. [2018-11-28 12:47:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:09,372 INFO L93 Difference]: Finished difference Result 667 states and 829 transitions. [2018-11-28 12:47:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:09,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-28 12:47:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:09,374 INFO L225 Difference]: With dead ends: 667 [2018-11-28 12:47:09,374 INFO L226 Difference]: Without dead ends: 622 [2018-11-28 12:47:09,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-11-28 12:47:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2018-11-28 12:47:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-28 12:47:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 771 transitions. [2018-11-28 12:47:09,404 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 771 transitions. Word has length 72 [2018-11-28 12:47:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:09,404 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 771 transitions. [2018-11-28 12:47:09,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 771 transitions. [2018-11-28 12:47:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:47:09,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:09,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:09,406 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:09,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:09,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2018-11-28 12:47:09,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:09,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:09,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:09,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:09,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:09,454 INFO L87 Difference]: Start difference. First operand 622 states and 771 transitions. Second operand 6 states. [2018-11-28 12:47:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:09,512 INFO L93 Difference]: Finished difference Result 663 states and 815 transitions. [2018-11-28 12:47:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:09,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-28 12:47:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:09,514 INFO L225 Difference]: With dead ends: 663 [2018-11-28 12:47:09,514 INFO L226 Difference]: Without dead ends: 627 [2018-11-28 12:47:09,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-28 12:47:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 622. [2018-11-28 12:47:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-28 12:47:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 769 transitions. [2018-11-28 12:47:09,548 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 769 transitions. Word has length 71 [2018-11-28 12:47:09,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:09,548 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 769 transitions. [2018-11-28 12:47:09,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 769 transitions. [2018-11-28 12:47:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:47:09,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:09,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:09,549 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:09,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:09,549 INFO L82 PathProgramCache]: Analyzing trace with hash 792976728, now seen corresponding path program 1 times [2018-11-28 12:47:09,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:09,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:09,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:09,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:09,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:09,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:09,633 INFO L87 Difference]: Start difference. First operand 622 states and 769 transitions. Second operand 11 states. [2018-11-28 12:47:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:09,748 INFO L93 Difference]: Finished difference Result 647 states and 796 transitions. [2018-11-28 12:47:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:09,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-28 12:47:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:09,749 INFO L225 Difference]: With dead ends: 647 [2018-11-28 12:47:09,749 INFO L226 Difference]: Without dead ends: 614 [2018-11-28 12:47:09,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-28 12:47:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2018-11-28 12:47:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-28 12:47:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 758 transitions. [2018-11-28 12:47:09,806 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 758 transitions. Word has length 71 [2018-11-28 12:47:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:09,806 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 758 transitions. [2018-11-28 12:47:09,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 758 transitions. [2018-11-28 12:47:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 12:47:09,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:09,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:09,807 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:09,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:09,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1953714458, now seen corresponding path program 1 times [2018-11-28 12:47:09,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:09,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:09,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:09,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:47:09,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:47:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:47:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:09,861 INFO L87 Difference]: Start difference. First operand 614 states and 758 transitions. Second operand 7 states. [2018-11-28 12:47:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:09,941 INFO L93 Difference]: Finished difference Result 668 states and 819 transitions. [2018-11-28 12:47:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:47:09,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-28 12:47:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:09,942 INFO L225 Difference]: With dead ends: 668 [2018-11-28 12:47:09,942 INFO L226 Difference]: Without dead ends: 612 [2018-11-28 12:47:09,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:47:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-28 12:47:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2018-11-28 12:47:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-28 12:47:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 748 transitions. [2018-11-28 12:47:09,974 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 748 transitions. Word has length 77 [2018-11-28 12:47:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:09,975 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 748 transitions. [2018-11-28 12:47:09,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:47:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 748 transitions. [2018-11-28 12:47:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 12:47:09,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:09,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:09,976 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:09,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1353976224, now seen corresponding path program 1 times [2018-11-28 12:47:09,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:09,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:10,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:10,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:47:10,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:47:10,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:47:10,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:47:10,077 INFO L87 Difference]: Start difference. First operand 608 states and 748 transitions. Second operand 14 states. [2018-11-28 12:47:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:10,211 INFO L93 Difference]: Finished difference Result 667 states and 810 transitions. [2018-11-28 12:47:10,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:47:10,211 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-28 12:47:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:10,212 INFO L225 Difference]: With dead ends: 667 [2018-11-28 12:47:10,212 INFO L226 Difference]: Without dead ends: 596 [2018-11-28 12:47:10,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:47:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-11-28 12:47:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2018-11-28 12:47:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-11-28 12:47:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 729 transitions. [2018-11-28 12:47:10,245 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 729 transitions. Word has length 72 [2018-11-28 12:47:10,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:10,245 INFO L480 AbstractCegarLoop]: Abstraction has 596 states and 729 transitions. [2018-11-28 12:47:10,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:47:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 729 transitions. [2018-11-28 12:47:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 12:47:10,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:10,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:10,246 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:10,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2018-11-28 12:47:10,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:10,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:10,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:10,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:47:10,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:47:10,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:47:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:47:10,313 INFO L87 Difference]: Start difference. First operand 596 states and 729 transitions. Second operand 10 states. [2018-11-28 12:47:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:11,331 INFO L93 Difference]: Finished difference Result 1176 states and 1441 transitions. [2018-11-28 12:47:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:47:11,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-28 12:47:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:11,333 INFO L225 Difference]: With dead ends: 1176 [2018-11-28 12:47:11,333 INFO L226 Difference]: Without dead ends: 1031 [2018-11-28 12:47:11,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:47:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-11-28 12:47:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 950. [2018-11-28 12:47:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-11-28 12:47:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1186 transitions. [2018-11-28 12:47:11,390 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1186 transitions. Word has length 73 [2018-11-28 12:47:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:11,390 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1186 transitions. [2018-11-28 12:47:11,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:47:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1186 transitions. [2018-11-28 12:47:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 12:47:11,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:11,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:11,391 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:11,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2018-11-28 12:47:11,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:11,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:11,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:11,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:11,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:11,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:11,432 INFO L87 Difference]: Start difference. First operand 950 states and 1186 transitions. Second operand 6 states. [2018-11-28 12:47:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:11,894 INFO L93 Difference]: Finished difference Result 1179 states and 1439 transitions. [2018-11-28 12:47:11,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:47:11,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-28 12:47:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:11,896 INFO L225 Difference]: With dead ends: 1179 [2018-11-28 12:47:11,896 INFO L226 Difference]: Without dead ends: 1074 [2018-11-28 12:47:11,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2018-11-28 12:47:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1015. [2018-11-28 12:47:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2018-11-28 12:47:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1259 transitions. [2018-11-28 12:47:11,960 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1259 transitions. Word has length 73 [2018-11-28 12:47:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:11,960 INFO L480 AbstractCegarLoop]: Abstraction has 1015 states and 1259 transitions. [2018-11-28 12:47:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1259 transitions. [2018-11-28 12:47:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 12:47:11,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:11,962 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:11,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1694643791, now seen corresponding path program 1 times [2018-11-28 12:47:11,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:12,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:12,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:12,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:12,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:12,052 INFO L87 Difference]: Start difference. First operand 1015 states and 1259 transitions. Second operand 6 states. [2018-11-28 12:47:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:12,189 INFO L93 Difference]: Finished difference Result 1289 states and 1615 transitions. [2018-11-28 12:47:12,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:12,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-28 12:47:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:12,192 INFO L225 Difference]: With dead ends: 1289 [2018-11-28 12:47:12,192 INFO L226 Difference]: Without dead ends: 1001 [2018-11-28 12:47:12,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-11-28 12:47:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2018-11-28 12:47:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-28 12:47:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1237 transitions. [2018-11-28 12:47:12,273 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1237 transitions. Word has length 77 [2018-11-28 12:47:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:12,273 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1237 transitions. [2018-11-28 12:47:12,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1237 transitions. [2018-11-28 12:47:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 12:47:12,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:12,274 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:12,274 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:12,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2018-11-28 12:47:12,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:12,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:47:12,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:12,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:12,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:12,316 INFO L87 Difference]: Start difference. First operand 1001 states and 1237 transitions. Second operand 5 states. [2018-11-28 12:47:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:12,394 INFO L93 Difference]: Finished difference Result 1046 states and 1285 transitions. [2018-11-28 12:47:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:12,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 12:47:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:12,396 INFO L225 Difference]: With dead ends: 1046 [2018-11-28 12:47:12,396 INFO L226 Difference]: Without dead ends: 1001 [2018-11-28 12:47:12,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-11-28 12:47:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2018-11-28 12:47:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-28 12:47:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1235 transitions. [2018-11-28 12:47:12,456 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1235 transitions. Word has length 75 [2018-11-28 12:47:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:12,456 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1235 transitions. [2018-11-28 12:47:12,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1235 transitions. [2018-11-28 12:47:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 12:47:12,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:12,457 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:12,457 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:12,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:12,457 INFO L82 PathProgramCache]: Analyzing trace with hash -509505287, now seen corresponding path program 1 times [2018-11-28 12:47:12,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:12,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:47:12,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:12,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:12,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:12,544 INFO L87 Difference]: Start difference. First operand 1001 states and 1235 transitions. Second operand 6 states. [2018-11-28 12:47:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:12,616 INFO L93 Difference]: Finished difference Result 1042 states and 1277 transitions. [2018-11-28 12:47:12,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:47:12,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-28 12:47:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:12,618 INFO L225 Difference]: With dead ends: 1042 [2018-11-28 12:47:12,618 INFO L226 Difference]: Without dead ends: 1001 [2018-11-28 12:47:12,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-11-28 12:47:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2018-11-28 12:47:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-28 12:47:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1233 transitions. [2018-11-28 12:47:12,681 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1233 transitions. Word has length 75 [2018-11-28 12:47:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:12,681 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1233 transitions. [2018-11-28 12:47:12,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1233 transitions. [2018-11-28 12:47:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 12:47:12,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:12,683 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:12,683 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:12,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978377, now seen corresponding path program 1 times [2018-11-28 12:47:12,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:47:12,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:12,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:12,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:12,741 INFO L87 Difference]: Start difference. First operand 1001 states and 1233 transitions. Second operand 11 states. [2018-11-28 12:47:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:12,857 INFO L93 Difference]: Finished difference Result 1023 states and 1256 transitions. [2018-11-28 12:47:12,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:12,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-28 12:47:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:12,859 INFO L225 Difference]: With dead ends: 1023 [2018-11-28 12:47:12,859 INFO L226 Difference]: Without dead ends: 965 [2018-11-28 12:47:12,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-11-28 12:47:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 959. [2018-11-28 12:47:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-11-28 12:47:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1181 transitions. [2018-11-28 12:47:12,923 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1181 transitions. Word has length 75 [2018-11-28 12:47:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:12,923 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1181 transitions. [2018-11-28 12:47:12,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1181 transitions. [2018-11-28 12:47:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 12:47:12,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:12,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:12,924 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:12,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1252114584, now seen corresponding path program 1 times [2018-11-28 12:47:12,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:12,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:13,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:13,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:47:13,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:47:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:47:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:47:13,039 INFO L87 Difference]: Start difference. First operand 959 states and 1181 transitions. Second operand 14 states. [2018-11-28 12:47:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:13,182 INFO L93 Difference]: Finished difference Result 987 states and 1210 transitions. [2018-11-28 12:47:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:47:13,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-28 12:47:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:13,185 INFO L225 Difference]: With dead ends: 987 [2018-11-28 12:47:13,185 INFO L226 Difference]: Without dead ends: 955 [2018-11-28 12:47:13,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:47:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-28 12:47:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2018-11-28 12:47:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-28 12:47:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1173 transitions. [2018-11-28 12:47:13,243 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1173 transitions. Word has length 77 [2018-11-28 12:47:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:13,243 INFO L480 AbstractCegarLoop]: Abstraction has 955 states and 1173 transitions. [2018-11-28 12:47:13,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:47:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1173 transitions. [2018-11-28 12:47:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 12:47:13,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:13,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:13,245 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:13,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash -235814922, now seen corresponding path program 1 times [2018-11-28 12:47:13,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:13,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:47:13,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:47:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:47:13,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:47:13,281 INFO L87 Difference]: Start difference. First operand 955 states and 1173 transitions. Second operand 5 states. [2018-11-28 12:47:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:13,511 INFO L93 Difference]: Finished difference Result 1197 states and 1491 transitions. [2018-11-28 12:47:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:13,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-28 12:47:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:13,513 INFO L225 Difference]: With dead ends: 1197 [2018-11-28 12:47:13,513 INFO L226 Difference]: Without dead ends: 923 [2018-11-28 12:47:13,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:47:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-28 12:47:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-11-28 12:47:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-28 12:47:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1133 transitions. [2018-11-28 12:47:13,568 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1133 transitions. Word has length 81 [2018-11-28 12:47:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:13,568 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1133 transitions. [2018-11-28 12:47:13,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:47:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1133 transitions. [2018-11-28 12:47:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 12:47:13,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:13,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] [2018-11-28 12:47:13,570 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:13,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2018-11-28 12:47:13,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:13,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:13,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:13,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:47:13,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:47:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:47:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:47:13,663 INFO L87 Difference]: Start difference. First operand 923 states and 1133 transitions. Second operand 10 states. [2018-11-28 12:47:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:14,670 INFO L93 Difference]: Finished difference Result 988 states and 1198 transitions. [2018-11-28 12:47:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:47:14,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-28 12:47:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:14,672 INFO L225 Difference]: With dead ends: 988 [2018-11-28 12:47:14,673 INFO L226 Difference]: Without dead ends: 855 [2018-11-28 12:47:14,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:47:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-11-28 12:47:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 429. [2018-11-28 12:47:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-28 12:47:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 525 transitions. [2018-11-28 12:47:14,709 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 525 transitions. Word has length 78 [2018-11-28 12:47:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:14,710 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 525 transitions. [2018-11-28 12:47:14,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:47:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 525 transitions. [2018-11-28 12:47:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 12:47:14,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:14,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:14,711 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:14,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2018-11-28 12:47:14,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:14,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:14,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:14,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:14,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:14,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:14,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 12:47:14,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:47:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:47:14,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:14,833 INFO L87 Difference]: Start difference. First operand 429 states and 525 transitions. Second operand 13 states. [2018-11-28 12:47:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:14,985 INFO L93 Difference]: Finished difference Result 431 states and 526 transitions. [2018-11-28 12:47:14,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:47:14,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-28 12:47:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:14,986 INFO L225 Difference]: With dead ends: 431 [2018-11-28 12:47:14,986 INFO L226 Difference]: Without dead ends: 367 [2018-11-28 12:47:14,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:47:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-28 12:47:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-28 12:47:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-28 12:47:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 457 transitions. [2018-11-28 12:47:15,015 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 457 transitions. Word has length 79 [2018-11-28 12:47:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:15,016 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 457 transitions. [2018-11-28 12:47:15,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:47:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 457 transitions. [2018-11-28 12:47:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 12:47:15,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:15,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:15,017 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:15,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922871, now seen corresponding path program 1 times [2018-11-28 12:47:15,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:15,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:15,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:15,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:47:15,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:47:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:47:15,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:15,040 INFO L87 Difference]: Start difference. First operand 367 states and 457 transitions. Second operand 3 states. [2018-11-28 12:47:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:15,077 INFO L93 Difference]: Finished difference Result 410 states and 502 transitions. [2018-11-28 12:47:15,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:47:15,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-28 12:47:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:15,078 INFO L225 Difference]: With dead ends: 410 [2018-11-28 12:47:15,078 INFO L226 Difference]: Without dead ends: 372 [2018-11-28 12:47:15,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-11-28 12:47:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2018-11-28 12:47:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-28 12:47:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 458 transitions. [2018-11-28 12:47:15,107 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 458 transitions. Word has length 80 [2018-11-28 12:47:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:15,107 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 458 transitions. [2018-11-28 12:47:15,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:47:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 458 transitions. [2018-11-28 12:47:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 12:47:15,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:15,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:15,108 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:15,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 327061127, now seen corresponding path program 1 times [2018-11-28 12:47:15,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:15,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:15,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:47:15,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:47:15,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:47:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:47:15,202 INFO L87 Difference]: Start difference. First operand 368 states and 458 transitions. Second operand 14 states. [2018-11-28 12:47:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:15,313 INFO L93 Difference]: Finished difference Result 383 states and 474 transitions. [2018-11-28 12:47:15,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:47:15,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-28 12:47:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:15,314 INFO L225 Difference]: With dead ends: 383 [2018-11-28 12:47:15,314 INFO L226 Difference]: Without dead ends: 310 [2018-11-28 12:47:15,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:47:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-28 12:47:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-11-28 12:47:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-28 12:47:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2018-11-28 12:47:15,340 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 80 [2018-11-28 12:47:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:15,340 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2018-11-28 12:47:15,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:47:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2018-11-28 12:47:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 12:47:15,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:15,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:15,341 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:15,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:15,341 INFO L82 PathProgramCache]: Analyzing trace with hash 121497713, now seen corresponding path program 1 times [2018-11-28 12:47:15,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:15,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:15,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:15,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:15,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:15,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:47:15,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:47:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:47:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:47:15,376 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2018-11-28 12:47:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:15,519 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2018-11-28 12:47:15,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:47:15,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-28 12:47:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:15,520 INFO L225 Difference]: With dead ends: 445 [2018-11-28 12:47:15,520 INFO L226 Difference]: Without dead ends: 303 [2018-11-28 12:47:15,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:47:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-28 12:47:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2018-11-28 12:47:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-28 12:47:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2018-11-28 12:47:15,543 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2018-11-28 12:47:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:15,544 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2018-11-28 12:47:15,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:47:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2018-11-28 12:47:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:47:15,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:15,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:15,545 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:15,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1235629862, now seen corresponding path program 1 times [2018-11-28 12:47:15,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:15,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:15,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:15,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:15,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:15,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 12:47:15,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:47:15,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:47:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:47:15,642 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2018-11-28 12:47:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:16,197 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-11-28 12:47:16,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:47:16,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-28 12:47:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:16,198 INFO L225 Difference]: With dead ends: 289 [2018-11-28 12:47:16,198 INFO L226 Difference]: Without dead ends: 266 [2018-11-28 12:47:16,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:47:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-28 12:47:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-11-28 12:47:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-28 12:47:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-11-28 12:47:16,221 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2018-11-28 12:47:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:16,221 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-11-28 12:47:16,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:47:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-11-28 12:47:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-28 12:47:16,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:16,222 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:16,223 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:16,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 31808508, now seen corresponding path program 1 times [2018-11-28 12:47:16,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:16,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:16,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:47:16,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:47:16,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/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-11-28 12:47:16,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:16,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:47:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:47:16,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:47:16,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-28 12:47:16,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:47:16,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:47:16,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:47:16,436 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 8 states. [2018-11-28 12:47:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:16,614 INFO L93 Difference]: Finished difference Result 410 states and 482 transitions. [2018-11-28 12:47:16,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:47:16,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2018-11-28 12:47:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:16,619 INFO L225 Difference]: With dead ends: 410 [2018-11-28 12:47:16,619 INFO L226 Difference]: Without dead ends: 246 [2018-11-28 12:47:16,619 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-11-28 12:47:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-28 12:47:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-11-28 12:47:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-28 12:47:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 283 transitions. [2018-11-28 12:47:16,655 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 283 transitions. Word has length 114 [2018-11-28 12:47:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:16,656 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 283 transitions. [2018-11-28 12:47:16,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:47:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 283 transitions. [2018-11-28 12:47:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:47:16,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:16,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:16,657 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:16,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash -642637310, now seen corresponding path program 1 times [2018-11-28 12:47:16,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:16,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:16,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:16,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:16,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:16,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:16,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:47:16,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:47:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:47:16,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:47:16,745 INFO L87 Difference]: Start difference. First operand 246 states and 283 transitions. Second operand 10 states. [2018-11-28 12:47:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:17,479 INFO L93 Difference]: Finished difference Result 529 states and 607 transitions. [2018-11-28 12:47:17,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:47:17,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-11-28 12:47:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:17,482 INFO L225 Difference]: With dead ends: 529 [2018-11-28 12:47:17,482 INFO L226 Difference]: Without dead ends: 423 [2018-11-28 12:47:17,483 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-11-28 12:47:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-11-28 12:47:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 365. [2018-11-28 12:47:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-28 12:47:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 416 transitions. [2018-11-28 12:47:17,525 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 416 transitions. Word has length 101 [2018-11-28 12:47:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:17,525 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 416 transitions. [2018-11-28 12:47:17,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:47:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 416 transitions. [2018-11-28 12:47:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:47:17,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:17,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:17,526 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:17,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1234425920, now seen corresponding path program 1 times [2018-11-28 12:47:17,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:17,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:17,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:47:17,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:17,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:47:17,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:47:17,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:47:17,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:47:17,586 INFO L87 Difference]: Start difference. First operand 365 states and 416 transitions. Second operand 8 states. [2018-11-28 12:47:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:17,649 INFO L93 Difference]: Finished difference Result 383 states and 435 transitions. [2018-11-28 12:47:17,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:47:17,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-28 12:47:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:17,652 INFO L225 Difference]: With dead ends: 383 [2018-11-28 12:47:17,652 INFO L226 Difference]: Without dead ends: 277 [2018-11-28 12:47:17,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:47:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-28 12:47:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 147. [2018-11-28 12:47:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-28 12:47:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-11-28 12:47:17,675 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 101 [2018-11-28 12:47:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:17,675 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-11-28 12:47:17,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:47:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-11-28 12:47:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 12:47:17,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:17,676 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:17,676 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:17,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -906281704, now seen corresponding path program 1 times [2018-11-28 12:47:17,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:17,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:17,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 12:47:17,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:17,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:17,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:17,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:17,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:17,763 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-11-28 12:47:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:18,093 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-11-28 12:47:18,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:47:18,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-11-28 12:47:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:18,095 INFO L225 Difference]: With dead ends: 169 [2018-11-28 12:47:18,095 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 12:47:18,096 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-11-28 12:47:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 12:47:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-28 12:47:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 12:47:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-28 12:47:18,114 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-11-28 12:47:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:18,115 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-28 12:47:18,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-28 12:47:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-28 12:47:18,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:18,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:18,116 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:18,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1647320713, now seen corresponding path program 1 times [2018-11-28 12:47:18,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:18,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 12:47:18,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:18,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:47:18,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:47:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:47:18,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:47:18,182 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-11-28 12:47:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:18,539 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-11-28 12:47:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:47:18,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-11-28 12:47:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:18,542 INFO L225 Difference]: With dead ends: 280 [2018-11-28 12:47:18,542 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 12:47:18,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:47:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 12:47:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-28 12:47:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 12:47:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-11-28 12:47:18,559 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-11-28 12:47:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:18,559 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-28 12:47:18,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:47:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-11-28 12:47:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-28 12:47:18,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:18,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:18,560 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:18,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:18,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1528879239, now seen corresponding path program 1 times [2018-11-28 12:47:18,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:18,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:18,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 12:47:18,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:18,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:47:18,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:47:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:47:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:18,596 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-11-28 12:47:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:18,627 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-11-28 12:47:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:47:18,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-28 12:47:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:18,630 INFO L225 Difference]: With dead ends: 192 [2018-11-28 12:47:18,630 INFO L226 Difference]: Without dead ends: 158 [2018-11-28 12:47:18,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-28 12:47:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-28 12:47:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 12:47:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-11-28 12:47:18,650 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-11-28 12:47:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:18,650 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-11-28 12:47:18,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:47:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-11-28 12:47:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-28 12:47:18,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:18,651 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:18,651 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:18,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1306094136, now seen corresponding path program 1 times [2018-11-28 12:47:18,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:18,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:18,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 12:47:18,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:18,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:47:18,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:47:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:47:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:18,700 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 3 states. [2018-11-28 12:47:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:18,726 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-11-28 12:47:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:47:18,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-28 12:47:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:18,727 INFO L225 Difference]: With dead ends: 191 [2018-11-28 12:47:18,727 INFO L226 Difference]: Without dead ends: 158 [2018-11-28 12:47:18,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:47:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-28 12:47:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-28 12:47:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 12:47:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-11-28 12:47:18,745 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 116 [2018-11-28 12:47:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:18,746 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-11-28 12:47:18,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:47:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-11-28 12:47:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-28 12:47:18,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:47:18,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:47:18,747 INFO L423 AbstractCegarLoop]: === Iteration 97 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:47:18,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:47:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash -142675845, now seen corresponding path program 1 times [2018-11-28 12:47:18,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:47:18,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:47:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:47:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:47:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:47:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 12:47:18,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:47:18,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:47:18,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:47:18,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:47:18,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:47:18,826 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 11 states. [2018-11-28 12:47:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:47:19,190 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-11-28 12:47:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:47:19,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-11-28 12:47:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:47:19,193 INFO L225 Difference]: With dead ends: 152 [2018-11-28 12:47:19,193 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:47:19,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:47:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:47:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:47:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:47:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:47:19,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-11-28 12:47:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:47:19,194 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:47:19,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:47:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:47:19,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:47:19,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:47:19,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:19,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:20,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:47:21,704 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 1 [2018-11-28 12:47:21,823 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-28 12:47:21,939 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-28 12:47:22,188 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 67 [2018-11-28 12:47:22,338 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 12:47:22,799 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 100 [2018-11-28 12:47:23,050 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-28 12:47:23,229 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2018-11-28 12:47:23,363 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-11-28 12:47:23,753 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2018-11-28 12:47:23,883 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 12:47:24,007 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 12:47:24,145 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 12:47:24,853 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-11-28 12:47:25,203 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 64 [2018-11-28 12:47:26,067 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 100 [2018-11-28 12:47:26,329 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2018-11-28 12:47:26,475 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2018-11-28 12:47:26,731 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2018-11-28 12:47:27,015 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-11-28 12:47:28,041 WARN L180 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 113 [2018-11-28 12:47:28,162 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-28 12:47:28,305 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2018-11-28 12:47:28,419 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 12:47:28,666 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2018-11-28 12:47:28,882 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 12:47:29,569 WARN L180 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-11-28 12:47:30,608 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 214 DAG size of output: 110 [2018-11-28 12:47:30,884 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 75 [2018-11-28 12:47:31,001 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-28 12:47:31,480 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 95 [2018-11-28 12:47:31,743 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 69 [2018-11-28 12:47:31,985 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 77 [2018-11-28 12:47:32,240 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2018-11-28 12:47:32,406 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2018-11-28 12:47:32,533 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2018-11-28 12:47:32,666 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-11-28 12:47:32,848 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2018-11-28 12:47:33,040 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-11-28 12:47:33,316 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 76 [2018-11-28 12:47:34,003 WARN L180 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-11-28 12:47:34,134 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-11-28 12:47:34,280 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-28 12:47:34,403 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 12:47:34,785 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 75 [2018-11-28 12:47:35,016 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2018-11-28 12:47:35,126 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2018-11-28 12:47:35,367 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-11-28 12:47:35,482 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-28 12:47:35,629 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-28 12:47:35,882 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-28 12:47:36,057 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-11-28 12:47:36,269 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 12:47:36,516 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-28 12:47:36,859 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2018-11-28 12:47:37,279 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2018-11-28 12:47:37,490 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2018-11-28 12:47:37,852 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 84 [2018-11-28 12:47:38,094 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 1 [2018-11-28 12:47:38,436 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 83 [2018-11-28 12:47:38,541 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-28 12:47:39,007 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2018-11-28 12:47:39,304 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2018-11-28 12:47:39,516 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-11-28 12:47:40,346 WARN L180 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-11-28 12:47:40,486 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2018-11-28 12:47:41,354 WARN L180 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 110 [2018-11-28 12:47:41,484 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2018-11-28 12:47:41,843 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-28 12:47:41,957 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2018-11-28 12:47:42,247 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-11-28 12:47:42,363 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2018-11-28 12:47:42,512 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2018-11-28 12:47:42,701 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 61 [2018-11-28 12:47:42,864 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2018-11-28 12:47:43,243 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2018-11-28 12:47:43,430 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-11-28 12:47:43,850 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 68 [2018-11-28 12:47:43,970 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-28 12:47:44,097 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 12:47:44,492 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2018-11-28 12:47:44,617 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 12:47:44,945 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 70 [2018-11-28 12:47:45,575 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-28 12:47:45,706 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-28 12:47:45,906 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2018-11-28 12:47:46,655 WARN L180 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 108 [2018-11-28 12:47:47,101 WARN L180 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 89 [2018-11-28 12:47:47,469 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 78 [2018-11-28 12:47:47,747 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2018-11-28 12:47:48,280 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2018-11-28 12:47:48,556 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 82 [2018-11-28 12:47:48,659 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2018-11-28 12:47:48,894 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-11-28 12:47:48,996 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-28 12:47:49,239 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2018-11-28 12:47:49,412 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 74 [2018-11-28 12:47:49,543 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-11-28 12:47:49,924 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-28 12:47:50,067 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2018-11-28 12:47:50,366 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2018-11-28 12:47:50,478 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 12:47:50,791 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 75 [2018-11-28 12:47:50,992 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2018-11-28 12:47:51,307 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 75 [2018-11-28 12:47:51,657 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 92 [2018-11-28 12:47:51,805 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2018-11-28 12:47:52,238 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 88 [2018-11-28 12:47:52,352 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-28 12:47:52,460 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2018-11-28 12:47:52,555 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-11-28 12:47:52,555 INFO L444 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (not (= 1 |old(~s~0)|))) (.cse0 (or .cse2 (or .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse4 .cse5 .cse6 .cse7 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse0 .cse1) (or (or (or .cse2 (or .cse3 .cse4 .cse5 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse6 .cse7) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (not (= ~myStatus~0 0)) (< 1 ~NP~0) .cse1) (not (= |old(~customIrp~0)| 0))) (or (and (= |old(~s~0)| ~s~0) (not (= 0 |SendSrbSynchronous_#in~Buffer|)) (= SendSrbSynchronous_~Buffer |SendSrbSynchronous_#in~Buffer|)) .cse0)))) [2018-11-28 12:47:52,555 INFO L448 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-11-28 12:47:52,556 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 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (or (or .cse0 (or .cse1 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse4 .cse5) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (not (= ~myStatus~0 0)) (< 1 ~NP~0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0)) (and (= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (or (= |old(~s~0)| ~s~0) (or .cse0 (or .cse1 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)))))) [2018-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-11-28 12:47:52,556 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-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-11-28 12:47:52,556 INFO L448 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L444 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (= |old(~s~0)| ~s~0)) (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= 1 |old(~s~0)|)))))) [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (let ((.cse2 (<= .cse1 0)) (.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (and (or (< 0 .cse1) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)) (or .cse2 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)))) (or .cse0 (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) .cse2) (not (= 1 |old(~s~0)|))) (or (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) .cse0)))) [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L444 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-11-28 12:47:52,557 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (or (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) [2018-11-28 12:47:52,558 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-11-28 12:47:52,558 INFO L444 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-28 12:47:52,558 INFO L444 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (or (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) [2018-11-28 12:47:52,559 INFO L448 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-11-28 12:47:52,559 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-28 12:47:52,559 INFO L444 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-28 12:47:52,559 INFO L444 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-28 12:47:52,559 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 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~s~0 ~NP~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 0) .cse12)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~myStatus~0) .cse11 .cse12))) (= |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-11-28 12:47:52,559 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-11-28 12:47:52,559 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-11-28 12:47:52,560 INFO L444 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse14 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (and (= 0 ~pended~0) .cse14))) (let ((.cse9 (<= 1 ~NP~0)) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (= ~IPC~0 ~s~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse3 (and .cse4 .cse6 .cse8)) (.cse15 (= 0 main_~status~9)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse7 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~status~9 1073741789) 0) .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)|)) (and .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse9 .cse10 .cse2 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8) (not (= |old(~compRegistered~0)| 0)) (and .cse4 .cse9 .cse10 .cse6 (<= 1 ~compRegistered~0) .cse12 (= ~routine~0 0) .cse14 .cse2 .cse11 .cse7 .cse13) (and .cse15 .cse7 .cse12 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 (not (= 259 main_~status~9)) .cse1 .cse2 .cse13 .cse3) (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 .cse15 .cse5 .cse7 .cse8) (not (= |old(~customIrp~0)| 0)))))) [2018-11-28 12:47:52,560 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-11-28 12:47:52,560 INFO L448 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-11-28 12:47:52,560 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-11-28 12:47:52,560 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-11-28 12:47:52,560 INFO L444 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse14 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (and (= 0 ~pended~0) .cse14))) (let ((.cse9 (<= 1 ~NP~0)) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (= ~IPC~0 ~s~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse3 (and .cse4 .cse6 .cse8)) (.cse15 (= 0 main_~status~9)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse7 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~status~9 1073741789) 0) .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)|)) (and .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse9 .cse10 .cse2 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8) (not (= |old(~compRegistered~0)| 0)) (and .cse4 .cse9 .cse10 .cse6 (<= 1 ~compRegistered~0) .cse12 (= ~routine~0 0) .cse14 .cse2 .cse11 .cse7 .cse13) (and .cse15 .cse7 .cse12 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 (not (= 259 main_~status~9)) .cse1 .cse2 .cse13 .cse3) (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 .cse15 .cse5 .cse7 .cse8) (not (= |old(~customIrp~0)| 0)))))) [2018-11-28 12:47:52,560 INFO L448 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-11-28 12:47:52,560 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-11-28 12:47:52,560 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-11-28 12:47:52,561 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-11-28 12:47:52,561 INFO L448 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-11-28 12:47:52,561 INFO L444 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse4 (= ~lowerDriverReturn~0 main_~status~9)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (<= ~s~0 ~DC~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (and (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse5 .cse6 (and .cse3 .cse4)) (and (and .cse5 .cse6 .cse3) (= ~DC~0 ~s~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and (and .cse1 .cse2 .cse0 (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~9))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse3 .cse4) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse0 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 12:47:52,561 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-11-28 12:47:52,561 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-11-28 12:47:52,561 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 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~s~0 ~NP~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (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)|)) (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 0) .cse12)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~myStatus~0) .cse11 .cse12) (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-11-28 12:47:52,561 INFO L444 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (= 0 main_~status~9)) (.cse4 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (and .cse10 .cse11 .cse2)) (.cse3 (= ~IPC~0 ~s~0)) (.cse8 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse4 (not (= 259 main_~status~9)) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse5 .cse6 (<= (+ main_~status~9 1073741789) 0) .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse10 (<= 1 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 (<= ~NP~0 1) .cse11 .cse1 .cse2 .cse3 .cse8) (and .cse10 .cse6 .cse9 .cse11 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 12:47:52,561 INFO L448 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-11-28 12:47:52,562 INFO L444 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse9 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (and .cse9 (= 0 ~pended~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse5 (<= 1 ~NP~0)) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= ~NP~0 1)) (.cse2 (= ~SKIP2~0 ~s~0)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse13 (= ~DC~0 ~s~0)) (.cse14 (and .cse4 .cse1 .cse7)) (.cse15 (<= (+ ~DC~0 5) ~IPC~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (= 0 main_~status~9)) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse8 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~myStatus~0)| 0)) (and .cse4 .cse5 .cse6 .cse7 (<= 1 ~compRegistered~0) .cse8 .cse9 (= ~routine~0 0) .cse10 .cse11 .cse3 .cse12) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse4 .cse5 .cse1 .cse6 .cse10 .cse11 .cse7 .cse3 .cse8 .cse12) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse1 .cse10 .cse2 .cse7 .cse3) (and .cse13 (not (= 259 main_~status~9)) .cse14 .cse15 .cse10 .cse12) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse13 .cse14 .cse15 .cse10 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse3 .cse8) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))))) [2018-11-28 12:47:52,562 INFO L448 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-11-28 12:47:52,562 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-11-28 12:47:52,562 INFO L448 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-11-28 12:47:52,562 INFO L448 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-11-28 12:47:52,562 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 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~s~0 ~NP~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 0) .cse12)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~myStatus~0) .cse11 .cse12))) (= |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-11-28 12:47:52,562 INFO L448 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-11-28 12:47:52,562 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-11-28 12:47:52,562 INFO L448 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-11-28 12:47:52,563 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-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-11-28 12:47:52,563 INFO L451 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-11-28 12:47:52,563 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-11-28 12:47:52,563 INFO L444 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (let ((.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< ~setEventCalled~0 1)) (.cse2 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1) (< ~NP~0 |old(~s~0)|))) (.cse3 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (< 1 ~setEventCalled~0))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse6) (< .cse6 0) .cse2 .cse3 .cse4 .cse5)))) (not (= ~customIrp~0 0))) [2018-11-28 12:47:52,563 INFO L448 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-11-28 12:47:52,564 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (let ((.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< ~setEventCalled~0 1)) (.cse2 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1) (< ~NP~0 |old(~s~0)|))) (.cse3 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (< 1 ~setEventCalled~0))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse6) (< .cse6 0) .cse2 .cse3 .cse4 .cse5)))) (= ~s~0 |old(~s~0)|) (not (= ~customIrp~0 0))) [2018-11-28 12:47:52,564 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-11-28 12:47:52,564 INFO L448 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-11-28 12:47:52,564 INFO L444 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0))) [2018-11-28 12:47:52,564 INFO L444 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,564 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-11-28 12:47:52,564 INFO L444 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,564 INFO L448 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-11-28 12:47:52,564 INFO L448 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-11-28 12:47:52,564 INFO L448 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-11-28 12:47:52,564 INFO L444 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,564 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L444 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L448 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-11-28 12:47:52,565 INFO L444 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,566 INFO L444 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-11-28 12:47:52,566 INFO L444 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-11-28 12:47:52,566 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)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-11-28 12:47:52,566 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)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-11-28 12:47:52,566 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-11-28 12:47:52,567 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-11-28 12:47:52,567 INFO L448 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-11-28 12:47:52,567 INFO L444 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse24 (+ ~myStatus~0 1073741637))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse24)) (.cse9 (< .cse24 0)) (.cse21 (not (= 1 |old(~s~0)|))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse8 (< |old(~setEventCalled~0)| 1)) (.cse4 (< 1 ~NP~0)) (.cse11 (< 1 |old(~setEventCalled~0)|)) (.cse15 (< ~compRegistered~0 1)) (.cse16 (not (= 1 ~routine~0))) (.cse18 (= ~s~0 1)) (.cse22 (= |old(~customIrp~0)| ~customIrp~0)) (.cse19 (let ((.cse23 (or .cse0 (or .cse13 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse14 .cse10 .cse3 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse7 .cse12 .cse23 .cse21) (or .cse7 .cse1 .cse9 .cse23 .cse21)))) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or (let ((.cse2 (< ~NP~0 1)) (.cse5 (or .cse13 .cse14 .cse15 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) (not (= |old(~s~0)| ~MPR3~0)) .cse17) (or .cse18 .cse19) (or (let ((.cse20 (or .cse6 .cse14 .cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse13 (< ~NP~0 |old(~s~0)|)) .cse15 .cse3 .cse16))) (and (or .cse7 .cse8 .cse12 .cse20 .cse4 .cse21 .cse11) (or .cse7 .cse8 .cse1 .cse9 .cse20 .cse4 .cse21 .cse11))) (and (and (<= 1 ~setEventCalled~0) .cse18 (<= ~setEventCalled~0 1)) .cse22) .cse17) (or .cse22 (or .cse19 .cse17)))))) [2018-11-28 12:47:52,567 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-11-28 12:47:52,567 INFO L448 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-11-28 12:47:52,567 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-11-28 12:47:52,567 INFO L444 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse24 (+ ~myStatus~0 1073741637))) (let ((.cse15 (not (= ~myStatus~0 0))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse4 (< 0 .cse24)) (.cse12 (< .cse24 0)) (.cse22 (not (= 1 |old(~s~0)|))) (.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (not (= 0 ~pended~0))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (let ((.cse23 (or .cse3 (or .cse16 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse17 .cse13 .cse6 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse10 .cse15 .cse23 .cse22) (or .cse10 .cse4 .cse12 .cse23 .cse22)))) (.cse0 (= ~s~0 1)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse7 (< 1 ~NP~0)) (.cse14 (< 1 |old(~setEventCalled~0)|)) (.cse18 (< ~compRegistered~0 1)) (.cse19 (not (= 1 ~routine~0))) (.cse20 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or (and .cse0 .cse2) (let ((.cse5 (< ~NP~0 1)) (.cse8 (or .cse16 .cse17 .cse18 .cse19))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse3 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) (not (= |old(~s~0)| ~MPR3~0)) .cse20) (or .cse2 (or .cse1 .cse20)) (or (and (and .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse2) (or (let ((.cse21 (or .cse9 .cse17 .cse13 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse16 (< ~NP~0 |old(~s~0)|)) .cse18 .cse6 .cse19))) (and (or .cse10 .cse11 .cse15 .cse21 .cse7 .cse22 .cse14) (or .cse10 .cse11 .cse4 .cse12 .cse21 .cse7 .cse22 .cse14))) .cse20)))))) [2018-11-28 12:47:52,567 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-11-28 12:47:52,568 INFO L444 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse24 (+ ~myStatus~0 1073741637))) (let ((.cse15 (not (= ~myStatus~0 0))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse4 (< 0 .cse24)) (.cse12 (< .cse24 0)) (.cse22 (not (= 1 |old(~s~0)|))) (.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (not (= 0 ~pended~0))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (let ((.cse23 (or .cse3 (or .cse16 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse17 .cse13 .cse6 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse10 .cse15 .cse23 .cse22) (or .cse10 .cse4 .cse12 .cse23 .cse22)))) (.cse0 (= ~s~0 1)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse7 (< 1 ~NP~0)) (.cse14 (< 1 |old(~setEventCalled~0)|)) (.cse18 (< ~compRegistered~0 1)) (.cse19 (not (= 1 ~routine~0))) (.cse20 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or (and .cse0 .cse2) (let ((.cse5 (< ~NP~0 1)) (.cse8 (or .cse16 .cse17 .cse18 .cse19))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse3 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) (not (= |old(~s~0)| ~MPR3~0)) .cse20) (or .cse2 (or .cse1 .cse20)) (or (and (and .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse2) (or (let ((.cse21 (or .cse9 .cse17 .cse13 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse16 (< ~NP~0 |old(~s~0)|)) .cse18 .cse6 .cse19))) (and (or .cse10 .cse11 .cse15 .cse21 .cse7 .cse22 .cse14) (or .cse10 .cse11 .cse4 .cse12 .cse21 .cse7 .cse22 .cse14))) .cse20)))))) [2018-11-28 12:47:52,568 INFO L444 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 ~pended~0))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse14 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 1 ~NP~0)) (.cse1 (< |old(~setEventCalled~0)| 1)) (.cse6 (< 1 |old(~setEventCalled~0)|)) (.cse13 (< ~compRegistered~0 1)) (.cse15 (not (= 1 ~routine~0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse7 (< 0 .cse21)) (.cse8 (< .cse21 0)) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse2 (not (= ~myStatus~0 0))) (.cse20 (or .cse17 (or .cse12 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse10 .cse11 .cse14 (< ~IPC~0 (+ ~DC~0 5)))) (.cse5 (not (= 1 |old(~s~0)|)))) (and (or (let ((.cse3 (or .cse9 .cse10 .cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse12 (< ~NP~0 |old(~s~0)|)) .cse13 .cse14 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6))) .cse16) (or (let ((.cse18 (< ~NP~0 1)) (.cse19 (or .cse12 .cse10 .cse13 .cse15))) (and (or .cse17 .cse7 .cse18 .cse14 .cse4 .cse19 .cse9 .cse0 .cse1 .cse8 .cse11 .cse6) (or .cse17 .cse18 .cse2 .cse14 .cse4 .cse19 .cse9 .cse0 .cse1 .cse11 .cse6))) (not (= |old(~s~0)| ~MPR3~0)) .cse16) (or .cse0 .cse7 .cse8 .cse20 .cse5) (or .cse0 .cse2 .cse20 .cse5)))) [2018-11-28 12:47:52,568 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-11-28 12:47:52,568 INFO L448 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-11-28 12:47:52,568 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-11-28 12:47:52,568 INFO L448 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-11-28 12:47:52,568 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-11-28 12:47:52,569 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse27 (+ ~myStatus~0 1073741637))) (let ((.cse8 (< |old(~setEventCalled~0)| 1)) (.cse4 (< 1 ~NP~0)) (.cse11 (< 1 |old(~setEventCalled~0)|)) (.cse15 (< ~compRegistered~0 1)) (.cse16 (not (= 1 ~routine~0))) (.cse21 (not (= |old(~customIrp~0)| 0))) (.cse12 (not (= ~myStatus~0 0))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse27)) (.cse9 (< .cse27 0)) (.cse25 (not (= 1 |old(~s~0)|))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse17 (= |old(~s~0)| ~s~0)) (.cse20 (= |old(~customIrp~0)| ~customIrp~0)) (.cse22 (let ((.cse26 (or .cse0 (or .cse13 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse14 .cse10 .cse3 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse7 .cse12 .cse26 .cse25) (or .cse7 .cse1 .cse9 .cse26 .cse25)))) (.cse18 (<= 1 ~setEventCalled~0)) (.cse19 (<= ~setEventCalled~0 1)) (.cse23 (or (let ((.cse24 (or .cse6 .cse14 .cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse13 (< ~NP~0 |old(~s~0)|)) .cse15 .cse3 .cse16))) (and (or .cse7 .cse8 .cse12 .cse24 .cse4 .cse25 .cse11) (or .cse7 .cse8 .cse1 .cse9 .cse24 .cse4 .cse25 .cse11))) .cse21))) (and (or (let ((.cse2 (< ~NP~0 1)) (.cse5 (or .cse13 .cse14 .cse15 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) (and (and .cse17 .cse18 .cse19) .cse20) (not (= |old(~s~0)| ~MPR3~0)) .cse21) (or .cse17 .cse22) (or .cse20 .cse23) (or .cse20 (or .cse22 .cse21)) (or (and (and .cse18 .cse19) (= ~s~0 |old(~s~0)|)) .cse23))))) [2018-11-28 12:47:52,569 INFO L444 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse15 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 5)) (.cse13 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse13)) (.cse1 (< ~MPR3~0 .cse14)) (.cse3 (< ~SKIP2~0 .cse15)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (and (<= .cse13 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse14 ~MPR3~0) (<= .cse15 ~SKIP2~0))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse2 0) .cse10 .cse11 .cse12)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-28 12:47:52,569 INFO L448 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-11-28 12:47:52,569 INFO L444 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~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)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (and (= 0 ~pended~0) (= ~s~0 1) (<= 1 ~compRegistered~0) (= ~routine~0 0)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11 .cse12)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-28 12:47:52,569 INFO L448 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-11-28 12:47:52,569 INFO L444 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse2 0) .cse10 .cse11 .cse12)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-28 12:47:52,569 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 (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-11-28 12:47:52,570 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 (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-11-28 12:47:52,570 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse0 (= |old(~s~0)| ~s~0))) (and (or .cse0 (or (or (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse5) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (< 1 ~NP~0) (not (= 1 |old(~s~0)|)))) (or .cse2 .cse1 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse0 (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) [2018-11-28 12:47:52,570 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-11-28 12:47:52,571 INFO L444 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (or (or .cse0 .cse1 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse4) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (< 1 ~NP~0) (not (= 1 |old(~s~0)|))) (or .cse1 .cse0 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) [2018-11-28 12:47:52,571 INFO L444 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,571 INFO L448 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-11-28 12:47:52,571 INFO L444 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,571 INFO L444 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-28 12:47:52,571 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-11-28 12:47:52,571 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-11-28 12:47:52,571 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-11-28 12:47:52,571 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-11-28 12:47:52,571 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-11-28 12:47:52,571 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ ~s~0 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= ~s~0 ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1)) (.cse11 (= 0 ~pended~0))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse1 0) .cse9 .cse10 .cse11 .cse12)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11))) [2018-11-28 12:47:52,571 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-11-28 12:47:52,572 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 (= 1 ~s~0)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (< .cse0 0) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1))) [2018-11-28 12:47:52,572 INFO L448 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-11-28 12:47:52,572 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 (= 1 ~s~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse11) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-28 12:47:52,572 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-11-28 12:47:52,572 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-11-28 12:47:52,572 INFO L448 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-11-28 12:47:52,572 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-11-28 12:47:52,572 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-11-28 12:47:52,576 INFO L448 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-11-28 12:47:52,576 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-11-28 12:47:52,576 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-11-28 12:47:52,576 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-11-28 12:47:52,576 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-11-28 12:47:52,576 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-11-28 12:47:52,577 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,577 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-11-28 12:47:52,577 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-11-28 12:47:52,577 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-28 12:47:52,577 INFO L448 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-11-28 12:47:52,577 INFO L444 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (and (and (= 0 ~pended~0) (= ~s~0 1) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-11-28 12:47:52,584 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-11-28 12:47:52,584 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-11-28 12:47:52,585 INFO L444 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,585 INFO L444 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,590 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 1) (= ~routine~0 0)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,590 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-11-28 12:47:52,590 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-11-28 12:47:52,590 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-28 12:47:52,590 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-28 12:47:52,590 INFO L444 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (<= (+ |old(~myStatus~0)| 1) 0) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-11-28 12:47:52,590 INFO L448 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-11-28 12:47:52,590 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-11-28 12:47:52,590 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) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~s~0 |old(~s~0)|) (<= (+ ~myStatus~0 1073741637) 0) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,594 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 1) (= ~routine~0 0)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,594 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (and (and (and (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,594 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-28 12:47:52,594 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-11-28 12:47:52,594 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-28 12:47:52,594 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-11-28 12:47:52,594 INFO L448 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-11-28 12:47:52,594 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-11-28 12:47:52,594 INFO L444 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-28 12:47:52,599 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-11-28 12:47:52,599 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-11-28 12:47:52,599 INFO L451 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-11-28 12:47:52,599 INFO L448 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-11-28 12:47:52,599 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-11-28 12:47:52,599 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-11-28 12:47:52,599 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-11-28 12:47:52,599 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-11-28 12:47:52,599 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-11-28 12:47:52,599 INFO L444 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,599 INFO L448 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-11-28 12:47:52,600 INFO L444 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-11-28 12:47:52,600 INFO L448 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-11-28 12:47:52,603 INFO L444 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,603 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-11-28 12:47:52,603 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-11-28 12:47:52,603 INFO L448 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-11-28 12:47:52,604 INFO L444 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,604 INFO L444 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0))) [2018-11-28 12:47:52,604 INFO L448 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-28 12:47:52,604 INFO L448 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-11-28 12:47:52,604 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-11-28 12:47:52,604 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-11-28 12:47:52,604 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,609 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) [2018-11-28 12:47:52,609 INFO L444 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,610 INFO L448 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-11-28 12:47:52,610 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-11-28 12:47:52,610 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-11-28 12:47:52,610 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-11-28 12:47:52,610 INFO L444 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,610 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-11-28 12:47:52,610 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-11-28 12:47:52,621 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-11-28 12:47:52,621 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-11-28 12:47:52,621 INFO L444 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-28 12:47:52,621 INFO L448 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-11-28 12:47:52,621 INFO L444 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,622 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-11-28 12:47:52,622 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-11-28 12:47:52,622 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-11-28 12:47:52,622 INFO L444 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,622 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-11-28 12:47:52,622 INFO L444 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (= 0 ~pended~0) (= ~s~0 1) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-28 12:47:52,632 INFO L448 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-11-28 12:47:52,632 INFO L448 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-11-28 12:47:52,633 INFO L444 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,633 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-11-28 12:47:52,633 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-11-28 12:47:52,633 INFO L448 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-11-28 12:47:52,633 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (and (<= 0 .cse12) (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (<= .cse12 0)))) [2018-11-28 12:47:52,633 INFO L444 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-28 12:47:52,647 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-11-28 12:47:52,647 INFO L448 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L444 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-11-28 12:47:52,648 INFO L444 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse12) (<= .cse12 0)))) [2018-11-28 12:47:52,648 INFO L448 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-11-28 12:47:52,656 INFO L444 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,657 INFO L448 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-11-28 12:47:52,657 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-11-28 12:47:52,657 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-11-28 12:47:52,657 INFO L444 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,657 INFO L448 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-11-28 12:47:52,657 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-11-28 12:47:52,657 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-11-28 12:47:52,657 INFO L444 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) [2018-11-28 12:47:52,657 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-11-28 12:47:52,658 INFO L444 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (and (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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,661 INFO L448 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-11-28 12:47:52,661 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-11-28 12:47:52,661 INFO L444 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,661 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-11-28 12:47:52,661 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-11-28 12:47:52,661 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-11-28 12:47:52,662 INFO L444 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~myStatus~0) (and (<= 0 .cse0) (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-28 12:47:52,662 INFO L448 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-11-28 12:47:52,662 INFO L448 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-11-28 12:47:52,662 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-11-28 12:47:52,662 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-11-28 12:47:52,662 INFO L448 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-11-28 12:47:52,662 INFO L444 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,667 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-11-28 12:47:52,667 INFO L448 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-11-28 12:47:52,668 INFO L444 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse27 (+ ~myStatus~0 1073741637)) (.cse26 (+ ~NP~0 5)) (.cse25 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse26 ~MPR3~0) (<= .cse25 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse21 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse27)) (.cse14 (< .cse27 0)) (.cse17 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse26)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (let ((.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~NP~0 1)) (.cse18 (< ~SKIP1~0 |old(~s~0)|)) (.cse19 (< |old(~s~0)| ~SKIP1~0)) (.cse20 (not (= ~compRegistered~0 0)))) (and (or .cse15 .cse0 .cse16 .cse1 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11) (or .cse15 .cse0 .cse13 .cse16 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse14 .cse19 .cse20 .cse10 .cse11))) (and .cse21 (= ~s~0 ~SKIP1~0))) (or (let ((.cse22 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse23 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse22 0) .cse21 (<= 0 .cse22) (<= 1 ~setEventCalled~0) (<= 0 .cse23) (= ~MPR1~0 ~s~0) (<= .cse23 0) (<= ~setEventCalled~0 1))) (let ((.cse24 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse24 .cse17 .cse4) (or .cse9 .cse13 .cse14 .cse24 .cse17 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-28 12:47:52,668 INFO L444 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse27 (+ ~myStatus~0 1073741637)) (.cse26 (+ ~NP~0 5)) (.cse25 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse26 ~MPR3~0) (<= .cse25 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse21 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse27)) (.cse14 (< .cse27 0)) (.cse17 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse26)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (let ((.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~NP~0 1)) (.cse18 (< ~SKIP1~0 |old(~s~0)|)) (.cse19 (< |old(~s~0)| ~SKIP1~0)) (.cse20 (not (= ~compRegistered~0 0)))) (and (or .cse15 .cse0 .cse16 .cse1 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11) (or .cse15 .cse0 .cse13 .cse16 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse14 .cse19 .cse20 .cse10 .cse11))) (and .cse21 (= ~s~0 ~SKIP1~0))) (or (let ((.cse22 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse23 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse22 0) .cse21 (<= 0 .cse22) (<= 1 ~setEventCalled~0) (<= 0 .cse23) (= ~MPR1~0 ~s~0) (<= .cse23 0) (<= ~setEventCalled~0 1))) (let ((.cse24 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse24 .cse17 .cse4) (or .cse9 .cse13 .cse14 .cse24 .cse17 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-28 12:47:52,673 INFO L448 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-11-28 12:47:52,674 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-11-28 12:47:52,674 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-11-28 12:47:52,674 INFO L448 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-11-28 12:47:52,674 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-11-28 12:47:52,674 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse23 (+ ~myStatus~0 1073741637)) (.cse21 (= 0 ~pended~0))) (let ((.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse12 (and .cse21 (= ~s~0 1))) (.cse5 (not (= 0 ~routine~0))) (.cse14 (not (= ~myStatus~0 0))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse23)) (.cse9 (< .cse23 0)) (.cse17 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse13 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (or (let ((.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~NP~0 1)) (.cse18 (< ~SKIP1~0 |old(~s~0)|)) (.cse19 (< |old(~s~0)| ~SKIP1~0)) (.cse20 (not (= ~compRegistered~0 0)))) (and (or .cse15 .cse0 .cse16 .cse14 .cse3 .cse17 .cse18 .cse5 .cse7 .cse8 .cse19 .cse20 .cse10 .cse11) (or .cse15 .cse0 .cse1 .cse16 .cse3 .cse17 .cse18 .cse5 .cse7 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11))) (and .cse21 (= ~s~0 ~SKIP1~0))) (or (and .cse21 (= |old(~s~0)| ~s~0)) (let ((.cse22 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse13 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse14 .cse22 .cse17 .cse4) (or .cse8 .cse1 .cse9 .cse22 .cse17 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-28 12:47:52,683 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-11-28 12:47:52,683 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-11-28 12:47:52,683 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-11-28 12:47:52,683 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-11-28 12:47:52,684 INFO L444 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse27 (+ ~myStatus~0 1073741637)) (.cse26 (+ ~NP~0 5)) (.cse25 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse26 ~MPR3~0) (<= .cse25 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse21 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse27)) (.cse14 (< .cse27 0)) (.cse17 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse26)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (let ((.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~NP~0 1)) (.cse18 (< ~SKIP1~0 |old(~s~0)|)) (.cse19 (< |old(~s~0)| ~SKIP1~0)) (.cse20 (not (= ~compRegistered~0 0)))) (and (or .cse15 .cse0 .cse16 .cse1 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11) (or .cse15 .cse0 .cse13 .cse16 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse14 .cse19 .cse20 .cse10 .cse11))) (and .cse21 (= ~s~0 ~SKIP1~0))) (or (let ((.cse22 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse23 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse22 0) .cse21 (<= 0 .cse22) (<= 1 ~setEventCalled~0) (<= 0 .cse23) (= ~MPR1~0 ~s~0) (<= .cse23 0) (<= ~setEventCalled~0 1))) (let ((.cse24 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse24 .cse17 .cse4) (or .cse9 .cse13 .cse14 .cse24 .cse17 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-28 12:47:52,684 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-11-28 12:47:52,695 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-11-28 12:47:52,695 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-11-28 12:47:52,695 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-11-28 12:47:52,696 INFO L444 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse21)) (.cse9 (< .cse21 0)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse14 (< ~NP~0 1)) (.cse19 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (< 1 ~NP~0)) (.cse16 (< ~SKIP1~0 |old(~s~0)|)) (.cse5 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (< |old(~s~0)| ~SKIP1~0)) (.cse18 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse14 .cse3 .cse15 .cse16 .cse5 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11) (or (let ((.cse20 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse19 .cse20 .cse15 .cse4) (or .cse8 .cse1 .cse9 .cse20 .cse15 .cse4))) (not (= ~customIrp~0 0))) (or .cse0 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse14 .cse19 .cse3 .cse15 .cse16 .cse5 .cse7 .cse8 .cse17 .cse18 .cse10 .cse11)))) [2018-11-28 12:47:52,696 INFO L448 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-11-28 12:47:52,696 INFO L444 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637))) (let ((.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse12 (and (= 0 ~pended~0) (= ~s~0 1))) (.cse1 (< 0 .cse22)) (.cse9 (< .cse22 0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse13 (< ~compRegistered~0 1)) (.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse16 (< ~NP~0 1)) (.cse14 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse17 (< 1 ~NP~0)) (.cse18 (< ~SKIP1~0 |old(~s~0)|)) (.cse5 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse19 (< |old(~s~0)| ~SKIP1~0)) (.cse20 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (or .cse15 .cse0 .cse1 .cse16 .cse3 .cse17 .cse18 .cse5 .cse7 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11) (or (let ((.cse21 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse13 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse14 .cse21 .cse17 .cse4) (or .cse8 .cse1 .cse9 .cse21 .cse17 .cse4))) (not (= ~customIrp~0 0))) (or .cse15 .cse0 .cse16 .cse14 .cse3 .cse17 .cse18 .cse5 .cse7 .cse8 .cse19 .cse20 .cse10 .cse11)))) [2018-11-28 12:47:52,696 INFO L448 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-11-28 12:47:52,696 INFO L444 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse27 (+ ~myStatus~0 1073741637)) (.cse26 (+ ~NP~0 5)) (.cse25 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse26 ~MPR3~0) (<= .cse25 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse21 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse27)) (.cse14 (< .cse27 0)) (.cse17 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse26)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (let ((.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~NP~0 1)) (.cse18 (< ~SKIP1~0 |old(~s~0)|)) (.cse19 (< |old(~s~0)| ~SKIP1~0)) (.cse20 (not (= ~compRegistered~0 0)))) (and (or .cse15 .cse0 .cse16 .cse1 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11) (or .cse15 .cse0 .cse13 .cse16 .cse3 .cse17 .cse18 .cse5 .cse8 .cse9 .cse14 .cse19 .cse20 .cse10 .cse11))) (and .cse21 (= ~s~0 ~SKIP1~0))) (or (let ((.cse22 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse23 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse22 0) .cse21 (<= 0 .cse22) (<= 1 ~setEventCalled~0) (<= 0 .cse23) (= ~MPR1~0 ~s~0) (<= .cse23 0) (<= ~setEventCalled~0 1))) (let ((.cse24 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse24 .cse17 .cse4) (or .cse9 .cse13 .cse14 .cse24 .cse17 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-28 12:47:52,706 INFO L444 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~compRegistered~0 1)) (.cse18 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse19 (< ~NP~0 1)) (.cse3 (not (= ~myStatus~0 0))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< 1 ~NP~0)) (.cse20 (< ~SKIP1~0 |old(~s~0)|)) (.cse16 (not (= 0 ~routine~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse21 (< |old(~s~0)| ~SKIP1~0)) (.cse22 (not (= ~compRegistered~0 0))) (.cse13 (not (= 0 |old(~pended~0)|))) (.cse14 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or (let ((.cse0 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse0 0) (= 0 ~pended~0) (<= 0 .cse0) (<= 1 ~setEventCalled~0) (<= 0 .cse1) (= |old(~s~0)| ~s~0) (<= .cse1 0) (<= ~setEventCalled~0 1))) (let ((.cse4 (or .cse9 .cse10 .cse11 (not (= 1 ~routine~0)) .cse12 .cse13 .cse14 .cse15 (< ~NP~0 |old(~s~0)|)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse2 .cse7 .cse8 .cse4 .cse5 .cse6))) (not (= ~customIrp~0 0))) (or .cse9 .cse7 .cse10 .cse11 .cse6 .cse16 .cse17 .cse12 .cse2 .cse8 .cse13 .cse14 .cse15) (or .cse18 .cse9 .cse7 .cse19 .cse11 .cse5 .cse20 .cse16 .cse12 .cse2 .cse8 .cse21 .cse22 .cse13 .cse14) (or .cse9 .cse3 .cse10 .cse11 .cse6 .cse16 .cse17 .cse12 .cse2 .cse13 .cse14 .cse15) (or .cse18 .cse9 .cse19 .cse3 .cse11 .cse5 .cse20 .cse16 .cse12 .cse2 .cse21 .cse22 .cse13 .cse14)))) [2018-11-28 12:47:52,707 INFO L444 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~NP~0 1)) (.cse16 (< ~SKIP1~0 |old(~s~0)|)) (.cse5 (not (= 0 ~routine~0))) (.cse17 (< |old(~s~0)| ~SKIP1~0)) (.cse18 (not (= ~compRegistered~0 0))) (.cse19 (not (= ~myStatus~0 0))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse21)) (.cse9 (< .cse21 0)) (.cse15 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse14 .cse3 .cse15 .cse16 .cse5 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11) (or .cse0 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse14 .cse19 .cse3 .cse15 .cse16 .cse5 .cse7 .cse8 .cse17 .cse18 .cse10 .cse11) (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse20 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse19 .cse20 .cse15 .cse4) (or .cse8 .cse1 .cse9 .cse20 .cse15 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-28 12:47:52,715 INFO L448 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-11-28 12:47:52,715 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-11-28 12:47:52,715 INFO L448 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-11-28 12:47:52,715 INFO L444 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-28 12:47:52,715 INFO L444 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-28 12:47:52,716 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-28 12:47:52,716 INFO L444 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-28 12:47:52,716 INFO L448 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-11-28 12:47:52,716 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-11-28 12:47:52,716 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-11-28 12:47:52,716 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-11-28 12:47:52,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:47:52,716 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-11-28 12:47:52,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:47:52,722 INFO L444 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 12:47:52,722 INFO L448 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-11-28 12:47:52,722 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L444 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 12:47:52,723 INFO L448 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L448 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L444 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 12:47:52,723 INFO L448 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L444 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 12:47:52,723 INFO L448 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L444 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 12:47:52,723 INFO L448 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-11-28 12:47:52,723 INFO L444 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,732 INFO L444 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,732 INFO L448 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-11-28 12:47:52,732 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-11-28 12:47:52,732 INFO L448 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-11-28 12:47:52,732 INFO L448 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-11-28 12:47:52,732 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-11-28 12:47:52,732 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-11-28 12:47:52,732 INFO L444 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse12 (+ ~NP~0 5))) (let ((.cse13 (and (= 0 ~pended~0) (<= .cse12 ~MPR3~0))) (.cse15 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse16 (= ~IPC~0 ~s~0)) (.cse14 (= ~routine~0 0))) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse13 .cse14 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (and .cse13 .cse15 .cse16 .cse14) (and (not (= 259 CdAudioDeviceControl_~status~3)) (= ~DC~0 ~s~0) (and .cse13 .cse14)) (and .cse15 (<= 1 ~compRegistered~0) .cse16 .cse14)))) [2018-11-28 12:47:52,732 INFO L444 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,743 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-11-28 12:47:52,743 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-11-28 12:47:52,743 INFO L444 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,743 INFO L448 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-11-28 12:47:52,743 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-11-28 12:47:52,743 INFO L444 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,743 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-28 12:47:52,743 INFO L444 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,754 INFO L444 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-28 12:47:52,754 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-11-28 12:47:52,754 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-11-28 12:47:52,754 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:47:52,754 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-11-28 12:47:52,754 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:47:52,754 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:47:52,754 INFO L444 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (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)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,754 INFO L448 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-11-28 12:47:52,764 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-28 12:47:52,764 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-11-28 12:47:52,764 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,764 INFO L448 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-11-28 12:47:52,764 INFO L448 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-11-28 12:47:52,764 INFO L444 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-28 12:47:52,764 INFO L448 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-11-28 12:47:52,764 INFO L448 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-11-28 12:47:52,764 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-11-28 12:47:52,764 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-11-28 12:47:52,765 INFO L444 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse0 0) (<= 0 .cse0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp109~1 4294967296) 1) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-28 12:47:52,775 INFO L448 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-11-28 12:47:52,775 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-11-28 12:47:52,775 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-28 12:47:52,775 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-11-28 12:47:52,775 INFO L444 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,775 INFO L448 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-11-28 12:47:52,775 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-11-28 12:47:52,776 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,782 INFO L448 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-11-28 12:47:52,783 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-11-28 12:47:52,783 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-11-28 12:47:52,783 INFO L448 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-11-28 12:47:52,783 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse0 (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) (or (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11)))))) [2018-11-28 12:47:52,783 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-11-28 12:47:52,783 INFO L448 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-11-28 12:47:52,783 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,783 INFO L448 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-11-28 12:47:52,783 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-11-28 12:47:52,783 INFO L444 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,794 INFO L444 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,794 INFO L444 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse15 (+ ~DC~0 2)) (.cse17 (+ ~NP~0 2)) (.cse16 (+ ~NP~0 5)) (.cse14 (+ ~SKIP1~0 2)) (.cse13 (+ ~MPR3~0 1))) (let ((.cse0 (and (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse15 ~SKIP2~0) (and (<= .cse17 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse16 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse14 ~MPR1~0))) (<= .cse13 ~IPC~0)))) (or (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (let ((.cse1 (< ~SKIP1~0 .cse17)) (.cse2 (< ~MPR3~0 .cse16)) (.cse3 (< ~SKIP2~0 .cse15)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse14)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 .cse13))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11)))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0)))) [2018-11-28 12:47:52,794 INFO L448 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-11-28 12:47:52,794 INFO L448 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-11-28 12:47:52,794 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-11-28 12:47:52,805 INFO L444 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,805 INFO L448 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-11-28 12:47:52,805 INFO L448 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-11-28 12:47:52,805 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-11-28 12:47:52,805 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-11-28 12:47:52,805 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-11-28 12:47:52,805 INFO L444 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (and (= 0 ~myStatus~0) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 1))) (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)|))) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 1 |old(~s~0)|))) (.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)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse13) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse13 0) .cse10 .cse11 .cse12))))) [2018-11-28 12:47:52,805 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,815 INFO L448 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-11-28 12:47:52,815 INFO L448 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-11-28 12:47:52,815 INFO L444 ceAbstractionStarter]: At program point L1116(lines 1115 1462) 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,815 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-11-28 12:47:52,815 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-11-28 12:47:52,815 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-11-28 12:47:52,815 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-11-28 12:47:52,816 INFO L444 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-11-28 12:47:52,816 INFO L448 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-11-28 12:47:52,816 INFO L444 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,819 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-11-28 12:47:52,819 INFO L444 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,819 INFO L448 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-11-28 12:47:52,819 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-11-28 12:47:52,819 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-11-28 12:47:52,819 INFO L448 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-11-28 12:47:52,819 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-11-28 12:47:52,819 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-11-28 12:47:52,819 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-28 12:47:52,823 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-11-28 12:47:52,823 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-11-28 12:47:52,823 INFO L448 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-11-28 12:47:52,823 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-11-28 12:47:52,824 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-28 12:47:52,824 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-11-28 12:47:52,824 INFO L448 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-11-28 12:47:52,824 INFO L444 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (= 0 ~pended~0) (= ~s~0 1)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,829 INFO L448 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-11-28 12:47:52,829 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-28 12:47:52,829 INFO L448 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-11-28 12:47:52,829 INFO L444 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,829 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-11-28 12:47:52,829 INFO L448 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-11-28 12:47:52,830 INFO L448 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-11-28 12:47:52,830 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-11-28 12:47:52,837 INFO L444 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (= 0 ~myStatus~0) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,837 INFO L448 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-11-28 12:47:52,838 INFO L448 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-11-28 12:47:52,838 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-28 12:47:52,840 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-11-28 12:47:52,840 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-11-28 12:47:52,840 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-11-28 12:47:52,840 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-11-28 12:47:52,841 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-11-28 12:47:52,841 INFO L448 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-11-28 12:47:52,841 INFO L448 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-11-28 12:47:52,841 INFO L444 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (and (= 0 ~myStatus~0) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 1))) (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)|))) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 1 |old(~s~0)|))) (.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)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse13) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse13 0) .cse10 .cse11 .cse12))))) [2018-11-28 12:47:52,841 INFO L448 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-11-28 12:47:52,841 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-11-28 12:47:52,841 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L444 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6))) [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-11-28 12:47:52,853 INFO L448 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-11-28 12:47:52,854 INFO L448 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-11-28 12:47:52,854 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-11-28 12:47:52,854 INFO L448 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-11-28 12:47:52,854 INFO L444 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L444 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-11-28 12:47:52,866 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-11-28 12:47:52,867 INFO L451 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-11-28 12:47:52,867 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-11-28 12:47:52,867 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-11-28 12:47:52,867 INFO L448 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-11-28 12:47:52,867 INFO L448 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-11-28 12:47:52,867 INFO L448 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-11-28 12:47:52,867 INFO L444 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0))) [2018-11-28 12:47:52,875 INFO L448 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-11-28 12:47:52,875 INFO L448 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-11-28 12:47:52,875 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-11-28 12:47:52,876 INFO L444 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (or (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0))) (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= ~routine~0 1) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)))) [2018-11-28 12:47:52,876 INFO L448 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-11-28 12:47:52,876 INFO L444 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,876 INFO L444 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0))) [2018-11-28 12:47:52,876 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-11-28 12:47:52,876 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-11-28 12:47:52,876 INFO L444 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse6 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse7 (= 0 ~pended~0)) (.cse9 (= ~routine~0 1)) (.cse10 (<= 1 ~setEventCalled~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse11 (<= ~setEventCalled~0 1)) (.cse12 (= |old(~customIrp~0)| ~customIrp~0))) (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (and (= ~s~0 ~MPR3~0) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and (and .cse6 .cse7 .cse9 .cse10 (= ~s~0 1) .cse8 .cse11) .cse12) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 12:47:52,884 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-11-28 12:47:52,885 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-11-28 12:47:52,885 INFO L451 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-11-28 12:47:52,885 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-11-28 12:47:52,885 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-11-28 12:47:52,885 INFO L448 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-11-28 12:47:52,885 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-11-28 12:47:52,885 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-11-28 12:47:52,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:47:52 BoogieIcfgContainer [2018-11-28 12:47:52,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:47:52,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:47:52,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:47:52,971 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:47:52,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:46:47" (3/4) ... [2018-11-28 12:47:52,974 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:47:52,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-28 12:47:52,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-11-28 12:47:52,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-11-28 12:47:52,984 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-11-28 12:47:52,984 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-11-28 12:47:52,984 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-28 12:47:53,003 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-11-28 12:47:53,005 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-28 12:47:53,008 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 12:47:53,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && NP + 5 <= MPR3) && routine == 0) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 12:47:53,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 12:47:53,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 12:47:53,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-28 12:47:53,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) [2018-11-28 12:47:53,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) [2018-11-28 12:47:53,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) [2018-11-28 12:47:53,041 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))) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) || !(\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-11-28 12:47:53,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) [2018-11-28 12:47:53,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-28 12:47:53,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) [2018-11-28 12:47:53,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && IPC == s) && routine == 0)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0) [2018-11-28 12:47:53,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))))) && (((((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || (((1 <= setEventCalled && s == 1) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0)) [2018-11-28 12:47:53,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-28 12:47:53,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-28 12:47:53,043 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) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) && \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-11-28 12:47:53,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-28 12:47:53,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-28 12:47:53,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-11-28 12:47:53,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) [2018-11-28 12:47:53,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) [2018-11-28 12:47:53,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) [2018-11-28 12:47:53,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) [2018-11-28 12:47:53,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == status && s == NP && 0 == pended) || (status + 1073741670 <= 0 && s == NP && 0 == pended)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,046 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-11-28 12:47:53,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) [2018-11-28 12:47:53,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 <= status + 1073741670 && 0 == pended) && s == 1) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) [2018-11-28 12:47:53,053 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && s == \old(s)) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-11-28 12:47:53,053 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == myStatus) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-11-28 12:47:53,053 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-28 12:47:53,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-28 12:47:53,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == myStatus && (((0 == pended && s == 1) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && s == 1) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-28 12:47:53,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,084 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && s == 1) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-28 12:47:53,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-28 12:47:53,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-28 12:47:53,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-28 12:47:53,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-28 12:47:53,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-28 12:47:53,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && \old(s) == s) [2018-11-28 12:47:53,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-28 12:47:53,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,143 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,143 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,143 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-28 12:47:53,299 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_65bc36d4-0781-415a-a67a-575ac84b8789/bin-2019/uautomizer/witness.graphml [2018-11-28 12:47:53,299 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:47:53,300 INFO L168 Benchmark]: Toolchain (without parser) took 67795.53 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 919.6 MB). Free memory was 950.6 MB in the beginning and 1.6 GB in the end (delta: -679.5 MB). Peak memory consumption was 240.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:47:53,301 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:47:53,301 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:47:53,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:47:53,301 INFO L168 Benchmark]: Boogie Preprocessor took 58.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:47:53,301 INFO L168 Benchmark]: RCFGBuilder took 1068.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.6 MB in the end (delta: 141.5 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:47:53,301 INFO L168 Benchmark]: TraceAbstraction took 65770.50 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 775.4 MB). Free memory was 979.6 MB in the beginning and 1.7 GB in the end (delta: -693.3 MB). Peak memory consumption was 959.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:47:53,302 INFO L168 Benchmark]: Witness Printer took 328.94 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:47:53,303 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 537.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1068.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.6 MB in the end (delta: 141.5 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65770.50 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 775.4 MB). Free memory was 979.6 MB in the beginning and 1.7 GB in the end (delta: -693.3 MB). Peak memory consumption was 959.9 MB. Max. memory is 11.5 GB. * Witness Printer took 328.94 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 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: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && s == 1) && (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) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && s == 1) && (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)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && NP + 5 <= MPR3) && routine == 0) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((0 == status && s == NP && 0 == pended) || (status + 1073741670 <= 0 && s == NP && 0 == pended)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - 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) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) && \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) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && \old(s) == s) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))))) && (((((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || (((1 <= setEventCalled && s == 1) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == SKIP1))) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((0 == pended && s == 1) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && IPC == s) && routine == 0)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && s == \old(s)) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (0 == myStatus && (((0 == pended && s == 1) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && s == 1) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - 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: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) || !(\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: (((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 <= status + 1073741670 && 0 == pended) && s == 1) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == myStatus) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - 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, 65.6s OverallTime, 97 OverallIterations, 2 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 33.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 50696 SDtfs, 21200 SDslu, 225884 SDs, 0 SdLazy, 23163 SolverSat, 3755 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1103 GetRequests, 338 SyntacticMatches, 9 SemanticMatches, 756 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1015occurred 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: 4.1s AutomataMinimizationTime, 97 MinimizatonAttempts, 2874 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1774 PreInvPairs, 2127 NumberOfFragments, 27672 HoareAnnotationTreeSize, 1774 FomulaSimplifications, 83670312 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 171 FomulaSimplificationsInter, 2366602 FormulaSimplificationTreeSizeReductionInter, 31.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 6551 NumberOfCodeBlocks, 6551 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 6453 ConstructedInterpolants, 0 QuantifiedInterpolants, 918467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 927 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 98 InterpolantComputations, 96 PerfectInterpolantSequences, 71/85 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...