./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/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_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d647228c0dc0174eb229424fd194f0e34ba347e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:35:01,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:35:01,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:35:01,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:35:01,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:35:01,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:35:01,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:35:01,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:35:01,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:35:01,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:35:01,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:35:01,254 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:35:01,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:35:01,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:35:01,255 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:35:01,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:35:01,256 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:35:01,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:35:01,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:35:01,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:35:01,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:35:01,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:35:01,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:35:01,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:35:01,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:35:01,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:35:01,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:35:01,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:35:01,263 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:35:01,264 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:35:01,264 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:35:01,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:35:01,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:35:01,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:35:01,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:35:01,265 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:35:01,265 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 08:35:01,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:35:01,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:35:01,276 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 08:35:01,276 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 08:35:01,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:35:01,277 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:35:01,277 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:35:01,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:35:01,277 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:35:01,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:35:01,278 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:35:01,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:35:01,278 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 08:35:01,278 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 08:35:01,278 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 08:35:01,278 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:35:01,279 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:35:01,279 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:35:01,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 08:35:01,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:35:01,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:35:01,279 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 08:35:01,279 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 08:35:01,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:35:01,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:35:01,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 08:35:01,280 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 08:35:01,280 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:35:01,280 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 08:35:01,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 08:35:01,281 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_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d647228c0dc0174eb229424fd194f0e34ba347e1 [2018-12-08 08:35:01,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:35:01,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:35:01,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:35:01,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:35:01,318 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:35:01,318 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 08:35:01,357 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/data/468561e55/91646b1a7db049dd8235a90f17d2637a/FLAG665b753d7 [2018-12-08 08:35:01,739 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:35:01,740 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 08:35:01,749 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/data/468561e55/91646b1a7db049dd8235a90f17d2637a/FLAG665b753d7 [2018-12-08 08:35:02,100 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/data/468561e55/91646b1a7db049dd8235a90f17d2637a [2018-12-08 08:35:02,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:35:02,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:35:02,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:35:02,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:35:02,108 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:35:02,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ade0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02, skipping insertion in model container [2018-12-08 08:35:02,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:35:02,155 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:35:02,379 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:35:02,383 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:35:02,484 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:35:02,497 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:35:02,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02 WrapperNode [2018-12-08 08:35:02,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:35:02,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:35:02,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:35:02,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:35:02,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:35:02,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:35:02,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:35:02,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:35:02,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... [2018-12-08 08:35:02,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:35:02,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:35:02,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:35:02,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:35:02,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:35:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-08 08:35:02,595 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-08 08:35:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-08 08:35:02,595 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-08 08:35:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-08 08:35:02,595 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-08 08:35:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-08 08:35:02,595 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-08 08:35:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 08:35:02,596 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 08:35:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-08 08:35:02,596 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-08 08:35:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-08 08:35:02,596 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-08 08:35:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-08 08:35:02,596 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-08 08:35:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-08 08:35:02,596 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-08 08:35:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-08 08:35:02,596 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-08 08:35:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-08 08:35:02,596 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-08 08:35:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-08 08:35:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-08 08:35:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-08 08:35:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-08 08:35:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-08 08:35:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-08 08:35:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-08 08:35:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-08 08:35:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:35:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-08 08:35:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-08 08:35:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-08 08:35:02,599 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-08 08:35:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-08 08:35:02,599 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-08 08:35:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-08 08:35:02,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-08 08:35:02,813 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:02,813 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:02,875 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:02,875 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:02,921 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:02,922 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:02,959 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:02,959 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:02,982 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:02,983 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:03,060 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:03,060 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:03,096 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:03,096 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:03,113 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:03,114 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:03,243 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 08:35:03,243 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 08:35:03,255 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:35:03,256 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 08:35:03,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:35:03 BoogieIcfgContainer [2018-12-08 08:35:03,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:35:03,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 08:35:03,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 08:35:03,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 08:35:03,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:35:02" (1/3) ... [2018-12-08 08:35:03,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c8ba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:35:03, skipping insertion in model container [2018-12-08 08:35:03,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:35:02" (2/3) ... [2018-12-08 08:35:03,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c8ba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:35:03, skipping insertion in model container [2018-12-08 08:35:03,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:35:03" (3/3) ... [2018-12-08 08:35:03,261 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 08:35:03,267 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 08:35:03,273 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 08:35:03,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 08:35:03,306 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:35:03,307 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 08:35:03,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 08:35:03,307 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 08:35:03,307 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:35:03,307 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:35:03,307 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 08:35:03,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:35:03,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 08:35:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2018-12-08 08:35:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 08:35:03,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:03,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:03,335 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:03,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2018-12-08 08:35:03,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:03,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:03,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:03,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:03,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:03,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:03,478 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2018-12-08 08:35:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:03,592 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2018-12-08 08:35:03,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:03,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 08:35:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:03,605 INFO L225 Difference]: With dead ends: 887 [2018-12-08 08:35:03,605 INFO L226 Difference]: Without dead ends: 507 [2018-12-08 08:35:03,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-08 08:35:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-12-08 08:35:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-12-08 08:35:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2018-12-08 08:35:03,657 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2018-12-08 08:35:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:03,658 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2018-12-08 08:35:03,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2018-12-08 08:35:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 08:35:03,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:03,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:03,659 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:03,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2018-12-08 08:35:03,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:03,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:03,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:03,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:03,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:03,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:03,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:03,730 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2018-12-08 08:35:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:03,875 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2018-12-08 08:35:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:03,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 08:35:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:03,879 INFO L225 Difference]: With dead ends: 789 [2018-12-08 08:35:03,879 INFO L226 Difference]: Without dead ends: 670 [2018-12-08 08:35:03,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-08 08:35:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2018-12-08 08:35:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-08 08:35:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2018-12-08 08:35:03,903 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2018-12-08 08:35:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:03,903 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2018-12-08 08:35:03,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2018-12-08 08:35:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 08:35:03,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:03,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:03,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:03,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:03,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1491411356, now seen corresponding path program 1 times [2018-12-08 08:35:03,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:03,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:03,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:03,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:03,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:03,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:03,942 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2018-12-08 08:35:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:03,975 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2018-12-08 08:35:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:03,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 08:35:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:03,980 INFO L225 Difference]: With dead ends: 995 [2018-12-08 08:35:03,980 INFO L226 Difference]: Without dead ends: 819 [2018-12-08 08:35:03,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-08 08:35:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2018-12-08 08:35:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-12-08 08:35:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2018-12-08 08:35:04,024 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2018-12-08 08:35:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:04,024 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2018-12-08 08:35:04,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2018-12-08 08:35:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 08:35:04,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:04,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:04,027 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:04,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1315443348, now seen corresponding path program 1 times [2018-12-08 08:35:04,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:04,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:04,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:04,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:04,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:04,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:04,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:04,071 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2018-12-08 08:35:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:04,234 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2018-12-08 08:35:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:04,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 08:35:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:04,240 INFO L225 Difference]: With dead ends: 1424 [2018-12-08 08:35:04,240 INFO L226 Difference]: Without dead ends: 1160 [2018-12-08 08:35:04,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-12-08 08:35:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2018-12-08 08:35:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-12-08 08:35:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2018-12-08 08:35:04,287 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2018-12-08 08:35:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:04,287 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2018-12-08 08:35:04,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2018-12-08 08:35:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 08:35:04,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:04,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] [2018-12-08 08:35:04,289 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:04,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1932537431, now seen corresponding path program 1 times [2018-12-08 08:35:04,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:04,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:04,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:04,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:04,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:04,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:04,337 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2018-12-08 08:35:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:04,831 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2018-12-08 08:35:04,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:04,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-08 08:35:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:04,836 INFO L225 Difference]: With dead ends: 1562 [2018-12-08 08:35:04,836 INFO L226 Difference]: Without dead ends: 984 [2018-12-08 08:35:04,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-12-08 08:35:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2018-12-08 08:35:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-08 08:35:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2018-12-08 08:35:04,868 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2018-12-08 08:35:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:04,868 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2018-12-08 08:35:04,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2018-12-08 08:35:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 08:35:04,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:04,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:04,870 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:04,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash -487494679, now seen corresponding path program 1 times [2018-12-08 08:35:04,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:04,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:04,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:04,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:04,902 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2018-12-08 08:35:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:04,959 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2018-12-08 08:35:04,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:04,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 08:35:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:04,962 INFO L225 Difference]: With dead ends: 890 [2018-12-08 08:35:04,962 INFO L226 Difference]: Without dead ends: 886 [2018-12-08 08:35:04,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-12-08 08:35:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-12-08 08:35:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-12-08 08:35:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2018-12-08 08:35:04,988 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2018-12-08 08:35:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:04,988 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2018-12-08 08:35:04,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2018-12-08 08:35:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 08:35:04,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:04,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:04,989 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:04,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1261036943, now seen corresponding path program 1 times [2018-12-08 08:35:04,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:04,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:05,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:05,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:05,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:05,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:05,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,020 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2018-12-08 08:35:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:05,051 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2018-12-08 08:35:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:05,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 08:35:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:05,054 INFO L225 Difference]: With dead ends: 1274 [2018-12-08 08:35:05,054 INFO L226 Difference]: Without dead ends: 1015 [2018-12-08 08:35:05,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-08 08:35:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2018-12-08 08:35:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-08 08:35:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2018-12-08 08:35:05,081 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2018-12-08 08:35:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:05,081 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2018-12-08 08:35:05,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2018-12-08 08:35:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 08:35:05,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:05,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:05,083 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:05,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2018-12-08 08:35:05,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:05,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:05,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:05,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,108 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2018-12-08 08:35:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:05,158 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2018-12-08 08:35:05,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:05,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-08 08:35:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:05,161 INFO L225 Difference]: With dead ends: 972 [2018-12-08 08:35:05,161 INFO L226 Difference]: Without dead ends: 954 [2018-12-08 08:35:05,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-08 08:35:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2018-12-08 08:35:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-08 08:35:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2018-12-08 08:35:05,189 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2018-12-08 08:35:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:05,189 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2018-12-08 08:35:05,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2018-12-08 08:35:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 08:35:05,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:05,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:05,191 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:05,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1159920127, now seen corresponding path program 1 times [2018-12-08 08:35:05,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:05,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:05,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:05,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:05,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:05,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,230 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2018-12-08 08:35:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:05,287 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2018-12-08 08:35:05,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:05,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-08 08:35:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:05,292 INFO L225 Difference]: With dead ends: 1167 [2018-12-08 08:35:05,292 INFO L226 Difference]: Without dead ends: 925 [2018-12-08 08:35:05,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-08 08:35:05,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2018-12-08 08:35:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-08 08:35:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2018-12-08 08:35:05,335 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2018-12-08 08:35:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:05,335 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2018-12-08 08:35:05,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2018-12-08 08:35:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 08:35:05,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:05,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:05,338 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:05,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -256141125, now seen corresponding path program 1 times [2018-12-08 08:35:05,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:05,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:05,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:05,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:35:05,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:35:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:35:05,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:35:05,368 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2018-12-08 08:35:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:05,624 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2018-12-08 08:35:05,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:35:05,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 08:35:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:05,626 INFO L225 Difference]: With dead ends: 1014 [2018-12-08 08:35:05,626 INFO L226 Difference]: Without dead ends: 785 [2018-12-08 08:35:05,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:35:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-12-08 08:35:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2018-12-08 08:35:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-12-08 08:35:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2018-12-08 08:35:05,648 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2018-12-08 08:35:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:05,649 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2018-12-08 08:35:05,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:35:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2018-12-08 08:35:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 08:35:05,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:05,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:05,650 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:05,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2018-12-08 08:35:05,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:05,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:05,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:05,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:05,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,669 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2018-12-08 08:35:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:05,704 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2018-12-08 08:35:05,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:05,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-08 08:35:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:05,708 INFO L225 Difference]: With dead ends: 871 [2018-12-08 08:35:05,708 INFO L226 Difference]: Without dead ends: 775 [2018-12-08 08:35:05,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-12-08 08:35:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2018-12-08 08:35:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-12-08 08:35:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2018-12-08 08:35:05,732 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2018-12-08 08:35:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:05,732 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2018-12-08 08:35:05,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2018-12-08 08:35:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 08:35:05,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:05,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:05,734 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:05,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2018-12-08 08:35:05,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:05,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:05,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:05,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:05,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,753 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2018-12-08 08:35:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:05,838 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2018-12-08 08:35:05,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:05,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-08 08:35:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:05,841 INFO L225 Difference]: With dead ends: 938 [2018-12-08 08:35:05,841 INFO L226 Difference]: Without dead ends: 928 [2018-12-08 08:35:05,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-12-08 08:35:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2018-12-08 08:35:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-08 08:35:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2018-12-08 08:35:05,870 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2018-12-08 08:35:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:05,870 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2018-12-08 08:35:05,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2018-12-08 08:35:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 08:35:05,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:05,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:05,872 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:05,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:05,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2018-12-08 08:35:05,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:05,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:05,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:05,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:05,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:05,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 08:35:05,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 08:35:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 08:35:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:35:05,919 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2018-12-08 08:35:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:06,024 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2018-12-08 08:35:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 08:35:06,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-08 08:35:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:06,028 INFO L225 Difference]: With dead ends: 851 [2018-12-08 08:35:06,028 INFO L226 Difference]: Without dead ends: 847 [2018-12-08 08:35:06,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-12-08 08:35:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2018-12-08 08:35:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-08 08:35:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2018-12-08 08:35:06,070 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2018-12-08 08:35:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:06,071 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2018-12-08 08:35:06,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 08:35:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2018-12-08 08:35:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 08:35:06,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:06,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:06,072 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:06,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:06,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2018-12-08 08:35:06,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:06,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:06,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:06,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:06,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:06,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 08:35:06,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 08:35:06,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 08:35:06,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:35:06,116 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2018-12-08 08:35:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:06,197 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2018-12-08 08:35:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 08:35:06,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-08 08:35:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:06,199 INFO L225 Difference]: With dead ends: 886 [2018-12-08 08:35:06,199 INFO L226 Difference]: Without dead ends: 865 [2018-12-08 08:35:06,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-08 08:35:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2018-12-08 08:35:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-12-08 08:35:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2018-12-08 08:35:06,228 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2018-12-08 08:35:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:06,228 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2018-12-08 08:35:06,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 08:35:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2018-12-08 08:35:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 08:35:06,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:06,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:06,230 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:06,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2018-12-08 08:35:06,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:06,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:06,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:06,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:06,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:06,248 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2018-12-08 08:35:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:06,349 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2018-12-08 08:35:06,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:06,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 08:35:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:06,354 INFO L225 Difference]: With dead ends: 1081 [2018-12-08 08:35:06,354 INFO L226 Difference]: Without dead ends: 1049 [2018-12-08 08:35:06,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-12-08 08:35:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2018-12-08 08:35:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-08 08:35:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2018-12-08 08:35:06,399 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2018-12-08 08:35:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:06,399 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2018-12-08 08:35:06,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2018-12-08 08:35:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 08:35:06,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:06,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:06,401 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:06,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2018-12-08 08:35:06,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:06,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:06,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:06,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:35:06,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:35:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:35:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:35:06,429 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2018-12-08 08:35:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:06,486 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2018-12-08 08:35:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:35:06,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-08 08:35:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:06,490 INFO L225 Difference]: With dead ends: 966 [2018-12-08 08:35:06,490 INFO L226 Difference]: Without dead ends: 944 [2018-12-08 08:35:06,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-12-08 08:35:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2018-12-08 08:35:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-08 08:35:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2018-12-08 08:35:06,534 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2018-12-08 08:35:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:06,534 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2018-12-08 08:35:06,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:35:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2018-12-08 08:35:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 08:35:06,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:06,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:06,536 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:06,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2018-12-08 08:35:06,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:06,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:06,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:06,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-12-08 08:35:06,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:06,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 08:35:06,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:35:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:35:06,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:06,586 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2018-12-08 08:35:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:07,252 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2018-12-08 08:35:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:35:07,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-08 08:35:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:07,255 INFO L225 Difference]: With dead ends: 1110 [2018-12-08 08:35:07,255 INFO L226 Difference]: Without dead ends: 1016 [2018-12-08 08:35:07,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:35:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-12-08 08:35:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2018-12-08 08:35:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-08 08:35:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2018-12-08 08:35:07,287 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2018-12-08 08:35:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:07,287 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2018-12-08 08:35:07,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:35:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2018-12-08 08:35:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 08:35:07,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:07,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] [2018-12-08 08:35:07,289 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:07,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2018-12-08 08:35:07,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:07,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:07,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:07,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:07,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:07,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:07,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 08:35:07,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 08:35:07,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:35:07,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:07,343 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 9 states. [2018-12-08 08:35:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:08,418 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2018-12-08 08:35:08,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 08:35:08,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-08 08:35:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:08,421 INFO L225 Difference]: With dead ends: 1188 [2018-12-08 08:35:08,421 INFO L226 Difference]: Without dead ends: 1119 [2018-12-08 08:35:08,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-12-08 08:35:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-08 08:35:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 887. [2018-12-08 08:35:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-08 08:35:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1205 transitions. [2018-12-08 08:35:08,454 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1205 transitions. Word has length 50 [2018-12-08 08:35:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:08,454 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1205 transitions. [2018-12-08 08:35:08,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 08:35:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1205 transitions. [2018-12-08 08:35:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 08:35:08,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:08,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] [2018-12-08 08:35:08,455 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:08,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2018-12-08 08:35:08,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:08,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:08,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:08,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:08,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:08,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:08,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:08,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:08,476 INFO L87 Difference]: Start difference. First operand 887 states and 1205 transitions. Second operand 3 states. [2018-12-08 08:35:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:08,546 INFO L93 Difference]: Finished difference Result 912 states and 1233 transitions. [2018-12-08 08:35:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:08,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-08 08:35:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:08,549 INFO L225 Difference]: With dead ends: 912 [2018-12-08 08:35:08,549 INFO L226 Difference]: Without dead ends: 907 [2018-12-08 08:35:08,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-12-08 08:35:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2018-12-08 08:35:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-12-08 08:35:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2018-12-08 08:35:08,581 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 52 [2018-12-08 08:35:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:08,581 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2018-12-08 08:35:08,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2018-12-08 08:35:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 08:35:08,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:08,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:08,583 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:08,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2018-12-08 08:35:08,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:08,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:08,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:08,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:08,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:08,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:08,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:08,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:08,604 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand 3 states. [2018-12-08 08:35:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:08,670 INFO L93 Difference]: Finished difference Result 1116 states and 1511 transitions. [2018-12-08 08:35:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:08,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-08 08:35:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:08,672 INFO L225 Difference]: With dead ends: 1116 [2018-12-08 08:35:08,672 INFO L226 Difference]: Without dead ends: 875 [2018-12-08 08:35:08,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-12-08 08:35:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2018-12-08 08:35:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-08 08:35:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1187 transitions. [2018-12-08 08:35:08,705 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1187 transitions. Word has length 54 [2018-12-08 08:35:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:08,705 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1187 transitions. [2018-12-08 08:35:08,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1187 transitions. [2018-12-08 08:35:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 08:35:08,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:08,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:08,707 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:08,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2018-12-08 08:35:08,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:08,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:08,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:08,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:08,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:08,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:08,740 INFO L87 Difference]: Start difference. First operand 875 states and 1187 transitions. Second operand 5 states. [2018-12-08 08:35:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:09,033 INFO L93 Difference]: Finished difference Result 885 states and 1195 transitions. [2018-12-08 08:35:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:09,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-08 08:35:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:09,035 INFO L225 Difference]: With dead ends: 885 [2018-12-08 08:35:09,035 INFO L226 Difference]: Without dead ends: 879 [2018-12-08 08:35:09,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-08 08:35:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 875. [2018-12-08 08:35:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-08 08:35:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1186 transitions. [2018-12-08 08:35:09,068 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1186 transitions. Word has length 53 [2018-12-08 08:35:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:09,068 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1186 transitions. [2018-12-08 08:35:09,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1186 transitions. [2018-12-08 08:35:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 08:35:09,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:09,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:09,069 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:09,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2018-12-08 08:35:09,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:09,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:09,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:09,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:09,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:09,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:09,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:09,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:09,101 INFO L87 Difference]: Start difference. First operand 875 states and 1186 transitions. Second operand 5 states. [2018-12-08 08:35:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:09,401 INFO L93 Difference]: Finished difference Result 887 states and 1197 transitions. [2018-12-08 08:35:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:09,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-08 08:35:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:09,403 INFO L225 Difference]: With dead ends: 887 [2018-12-08 08:35:09,403 INFO L226 Difference]: Without dead ends: 851 [2018-12-08 08:35:09,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-08 08:35:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 847. [2018-12-08 08:35:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-08 08:35:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1154 transitions. [2018-12-08 08:35:09,434 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1154 transitions. Word has length 52 [2018-12-08 08:35:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:09,434 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1154 transitions. [2018-12-08 08:35:09,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1154 transitions. [2018-12-08 08:35:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 08:35:09,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:09,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:09,436 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:09,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:09,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2018-12-08 08:35:09,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:09,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:09,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:09,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:09,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:09,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:09,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:09,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:09,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:09,465 INFO L87 Difference]: Start difference. First operand 847 states and 1154 transitions. Second operand 5 states. [2018-12-08 08:35:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:09,783 INFO L93 Difference]: Finished difference Result 855 states and 1160 transitions. [2018-12-08 08:35:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:09,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-08 08:35:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:09,785 INFO L225 Difference]: With dead ends: 855 [2018-12-08 08:35:09,785 INFO L226 Difference]: Without dead ends: 849 [2018-12-08 08:35:09,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-12-08 08:35:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2018-12-08 08:35:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-08 08:35:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2018-12-08 08:35:09,835 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2018-12-08 08:35:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:09,835 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2018-12-08 08:35:09,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2018-12-08 08:35:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 08:35:09,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:09,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:09,837 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:09,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2018-12-08 08:35:09,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:09,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:09,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:09,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:09,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:09,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:35:09,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:35:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:35:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:35:09,879 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 4 states. [2018-12-08 08:35:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:09,988 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2018-12-08 08:35:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:35:09,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-08 08:35:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:09,991 INFO L225 Difference]: With dead ends: 886 [2018-12-08 08:35:09,991 INFO L226 Difference]: Without dead ends: 854 [2018-12-08 08:35:09,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-12-08 08:35:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 849. [2018-12-08 08:35:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-12-08 08:35:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1155 transitions. [2018-12-08 08:35:10,031 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1155 transitions. Word has length 55 [2018-12-08 08:35:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:10,031 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1155 transitions. [2018-12-08 08:35:10,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:35:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1155 transitions. [2018-12-08 08:35:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 08:35:10,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:10,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:10,032 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:10,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2018-12-08 08:35:10,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:10,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:10,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:10,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:10,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:10,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 08:35:10,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 08:35:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:35:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:10,080 INFO L87 Difference]: Start difference. First operand 849 states and 1155 transitions. Second operand 9 states. [2018-12-08 08:35:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:10,233 INFO L93 Difference]: Finished difference Result 876 states and 1185 transitions. [2018-12-08 08:35:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:35:10,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-08 08:35:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:10,236 INFO L225 Difference]: With dead ends: 876 [2018-12-08 08:35:10,236 INFO L226 Difference]: Without dead ends: 838 [2018-12-08 08:35:10,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-12-08 08:35:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-12-08 08:35:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-12-08 08:35:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2018-12-08 08:35:10,267 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2018-12-08 08:35:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:10,267 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2018-12-08 08:35:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 08:35:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2018-12-08 08:35:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 08:35:10,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:10,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:10,268 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:10,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash 64942578, now seen corresponding path program 1 times [2018-12-08 08:35:10,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:10,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:10,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 08:35:10,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:35:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:35:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:35:10,336 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2018-12-08 08:35:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:10,497 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2018-12-08 08:35:10,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 08:35:10,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-08 08:35:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:10,499 INFO L225 Difference]: With dead ends: 854 [2018-12-08 08:35:10,499 INFO L226 Difference]: Without dead ends: 836 [2018-12-08 08:35:10,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-12-08 08:35:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2018-12-08 08:35:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-12-08 08:35:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2018-12-08 08:35:10,530 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 55 [2018-12-08 08:35:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:10,530 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2018-12-08 08:35:10,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:35:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2018-12-08 08:35:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 08:35:10,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:10,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:10,531 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:10,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash -405944758, now seen corresponding path program 1 times [2018-12-08 08:35:10,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:10,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:10,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:10,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 08:35:10,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:35:10,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:35:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:35:10,611 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2018-12-08 08:35:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:10,762 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2018-12-08 08:35:10,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 08:35:10,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-08 08:35:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:10,764 INFO L225 Difference]: With dead ends: 849 [2018-12-08 08:35:10,765 INFO L226 Difference]: Without dead ends: 831 [2018-12-08 08:35:10,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-08 08:35:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-12-08 08:35:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-08 08:35:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2018-12-08 08:35:10,802 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 56 [2018-12-08 08:35:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:10,803 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2018-12-08 08:35:10,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:35:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2018-12-08 08:35:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 08:35:10,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:10,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:10,804 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:10,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:10,804 INFO L82 PathProgramCache]: Analyzing trace with hash 804739700, now seen corresponding path program 1 times [2018-12-08 08:35:10,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:10,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:10,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:10,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:10,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:10,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:10,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:10,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:10,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:10,847 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2018-12-08 08:35:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:11,319 INFO L93 Difference]: Finished difference Result 1378 states and 1925 transitions. [2018-12-08 08:35:11,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:11,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-08 08:35:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:11,322 INFO L225 Difference]: With dead ends: 1378 [2018-12-08 08:35:11,322 INFO L226 Difference]: Without dead ends: 1214 [2018-12-08 08:35:11,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-12-08 08:35:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2018-12-08 08:35:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-12-08 08:35:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2018-12-08 08:35:11,378 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2018-12-08 08:35:11,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:11,379 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2018-12-08 08:35:11,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2018-12-08 08:35:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 08:35:11,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:11,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:11,380 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:11,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2018-12-08 08:35:11,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:11,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:11,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:11,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:11,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:11,479 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2018-12-08 08:35:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:11,655 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2018-12-08 08:35:11,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:11,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-08 08:35:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:11,657 INFO L225 Difference]: With dead ends: 886 [2018-12-08 08:35:11,657 INFO L226 Difference]: Without dead ends: 866 [2018-12-08 08:35:11,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-12-08 08:35:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2018-12-08 08:35:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-12-08 08:35:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2018-12-08 08:35:11,696 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2018-12-08 08:35:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:11,696 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2018-12-08 08:35:11,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2018-12-08 08:35:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 08:35:11,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:11,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:11,698 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:11,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash -894292447, now seen corresponding path program 1 times [2018-12-08 08:35:11,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:11,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:11,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:11,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:11,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:11,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:11,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 08:35:11,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:35:11,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:35:11,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:35:11,784 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 12 states. [2018-12-08 08:35:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:11,964 INFO L93 Difference]: Finished difference Result 892 states and 1196 transitions. [2018-12-08 08:35:11,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:11,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-08 08:35:11,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:11,966 INFO L225 Difference]: With dead ends: 892 [2018-12-08 08:35:11,966 INFO L226 Difference]: Without dead ends: 867 [2018-12-08 08:35:11,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:35:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-08 08:35:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-12-08 08:35:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-08 08:35:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2018-12-08 08:35:11,999 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 59 [2018-12-08 08:35:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:12,000 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2018-12-08 08:35:12,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:35:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2018-12-08 08:35:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 08:35:12,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:12,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:12,001 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:12,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2018-12-08 08:35:12,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:12,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:12,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:12,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:12,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:12,031 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand 3 states. [2018-12-08 08:35:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:12,061 INFO L93 Difference]: Finished difference Result 899 states and 1191 transitions. [2018-12-08 08:35:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:12,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-08 08:35:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:12,064 INFO L225 Difference]: With dead ends: 899 [2018-12-08 08:35:12,064 INFO L226 Difference]: Without dead ends: 867 [2018-12-08 08:35:12,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-08 08:35:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-12-08 08:35:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-08 08:35:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1156 transitions. [2018-12-08 08:35:12,107 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1156 transitions. Word has length 59 [2018-12-08 08:35:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:12,107 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1156 transitions. [2018-12-08 08:35:12,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1156 transitions. [2018-12-08 08:35:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 08:35:12,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:12,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] [2018-12-08 08:35:12,108 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:12,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2018-12-08 08:35:12,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:12,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:12,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:12,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 08:35:12,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 08:35:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:35:12,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:12,157 INFO L87 Difference]: Start difference. First operand 865 states and 1156 transitions. Second operand 9 states. [2018-12-08 08:35:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:12,275 INFO L93 Difference]: Finished difference Result 887 states and 1179 transitions. [2018-12-08 08:35:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:35:12,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-12-08 08:35:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:12,277 INFO L225 Difference]: With dead ends: 887 [2018-12-08 08:35:12,277 INFO L226 Difference]: Without dead ends: 853 [2018-12-08 08:35:12,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-12-08 08:35:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2018-12-08 08:35:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-12-08 08:35:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1136 transitions. [2018-12-08 08:35:12,310 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1136 transitions. Word has length 59 [2018-12-08 08:35:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:12,310 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1136 transitions. [2018-12-08 08:35:12,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 08:35:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1136 transitions. [2018-12-08 08:35:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 08:35:12,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:12,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:12,311 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:12,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:12,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2018-12-08 08:35:12,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:12,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:12,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:12,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:12,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:35:12,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:35:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:35:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:35:12,340 INFO L87 Difference]: Start difference. First operand 853 states and 1136 transitions. Second operand 4 states. [2018-12-08 08:35:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:12,447 INFO L93 Difference]: Finished difference Result 1009 states and 1359 transitions. [2018-12-08 08:35:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:35:12,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-08 08:35:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:12,449 INFO L225 Difference]: With dead ends: 1009 [2018-12-08 08:35:12,449 INFO L226 Difference]: Without dead ends: 898 [2018-12-08 08:35:12,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-12-08 08:35:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 860. [2018-12-08 08:35:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-12-08 08:35:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1152 transitions. [2018-12-08 08:35:12,482 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1152 transitions. Word has length 60 [2018-12-08 08:35:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:12,483 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1152 transitions. [2018-12-08 08:35:12,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:35:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1152 transitions. [2018-12-08 08:35:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 08:35:12,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:12,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:12,484 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:12,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2018-12-08 08:35:12,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:12,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:12,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:12,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:12,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:12,552 INFO L87 Difference]: Start difference. First operand 860 states and 1152 transitions. Second operand 11 states. [2018-12-08 08:35:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:12,657 INFO L93 Difference]: Finished difference Result 929 states and 1245 transitions. [2018-12-08 08:35:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:12,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-08 08:35:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:12,659 INFO L225 Difference]: With dead ends: 929 [2018-12-08 08:35:12,659 INFO L226 Difference]: Without dead ends: 874 [2018-12-08 08:35:12,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-12-08 08:35:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 864. [2018-12-08 08:35:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-12-08 08:35:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1170 transitions. [2018-12-08 08:35:12,698 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1170 transitions. Word has length 60 [2018-12-08 08:35:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:12,699 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1170 transitions. [2018-12-08 08:35:12,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1170 transitions. [2018-12-08 08:35:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 08:35:12,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:12,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:12,700 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:12,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2018-12-08 08:35:12,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:12,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:12,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:12,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 08:35:12,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 08:35:12,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:35:12,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:12,760 INFO L87 Difference]: Start difference. First operand 864 states and 1170 transitions. Second operand 9 states. [2018-12-08 08:35:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:12,893 INFO L93 Difference]: Finished difference Result 895 states and 1207 transitions. [2018-12-08 08:35:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:35:12,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-08 08:35:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:12,895 INFO L225 Difference]: With dead ends: 895 [2018-12-08 08:35:12,895 INFO L226 Difference]: Without dead ends: 856 [2018-12-08 08:35:12,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-12-08 08:35:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-12-08 08:35:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-08 08:35:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-12-08 08:35:12,938 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 60 [2018-12-08 08:35:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:12,938 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-12-08 08:35:12,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 08:35:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-12-08 08:35:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 08:35:12,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:12,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:12,940 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:12,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2018-12-08 08:35:12,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:12,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:12,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:13,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:13,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 08:35:13,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:35:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:35:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:13,067 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 13 states. [2018-12-08 08:35:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:13,256 INFO L93 Difference]: Finished difference Result 873 states and 1172 transitions. [2018-12-08 08:35:13,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:35:13,257 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-08 08:35:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:13,259 INFO L225 Difference]: With dead ends: 873 [2018-12-08 08:35:13,259 INFO L226 Difference]: Without dead ends: 851 [2018-12-08 08:35:13,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:35:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-08 08:35:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-12-08 08:35:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-08 08:35:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1147 transitions. [2018-12-08 08:35:13,290 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1147 transitions. Word has length 62 [2018-12-08 08:35:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:13,290 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1147 transitions. [2018-12-08 08:35:13,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:35:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1147 transitions. [2018-12-08 08:35:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 08:35:13,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:13,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:13,292 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:13,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2018-12-08 08:35:13,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:13,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:13,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:13,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:13,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:13,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:13,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:13,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:13,307 INFO L87 Difference]: Start difference. First operand 851 states and 1147 transitions. Second operand 3 states. [2018-12-08 08:35:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:13,335 INFO L93 Difference]: Finished difference Result 1124 states and 1516 transitions. [2018-12-08 08:35:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:13,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-08 08:35:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:13,338 INFO L225 Difference]: With dead ends: 1124 [2018-12-08 08:35:13,338 INFO L226 Difference]: Without dead ends: 790 [2018-12-08 08:35:13,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-08 08:35:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 741. [2018-12-08 08:35:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-08 08:35:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 964 transitions. [2018-12-08 08:35:13,369 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 964 transitions. Word has length 62 [2018-12-08 08:35:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:13,369 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 964 transitions. [2018-12-08 08:35:13,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 964 transitions. [2018-12-08 08:35:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 08:35:13,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:13,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:13,371 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:13,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash 551685876, now seen corresponding path program 1 times [2018-12-08 08:35:13,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:13,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:13,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:13,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:13,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:13,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 08:35:13,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:35:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:35:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:35:13,459 INFO L87 Difference]: Start difference. First operand 741 states and 964 transitions. Second operand 12 states. [2018-12-08 08:35:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:13,623 INFO L93 Difference]: Finished difference Result 765 states and 989 transitions. [2018-12-08 08:35:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:13,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-08 08:35:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:13,625 INFO L225 Difference]: With dead ends: 765 [2018-12-08 08:35:13,625 INFO L226 Difference]: Without dead ends: 741 [2018-12-08 08:35:13,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:35:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-12-08 08:35:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2018-12-08 08:35:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-08 08:35:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 960 transitions. [2018-12-08 08:35:13,654 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 960 transitions. Word has length 66 [2018-12-08 08:35:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:13,655 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 960 transitions. [2018-12-08 08:35:13,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:35:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 960 transitions. [2018-12-08 08:35:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 08:35:13,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:13,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:13,656 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:13,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1661318765, now seen corresponding path program 1 times [2018-12-08 08:35:13,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:13,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:13,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:13,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:13,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:13,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:13,702 INFO L87 Difference]: Start difference. First operand 739 states and 960 transitions. Second operand 5 states. [2018-12-08 08:35:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:13,805 INFO L93 Difference]: Finished difference Result 773 states and 1000 transitions. [2018-12-08 08:35:13,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:13,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-08 08:35:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:13,807 INFO L225 Difference]: With dead ends: 773 [2018-12-08 08:35:13,807 INFO L226 Difference]: Without dead ends: 746 [2018-12-08 08:35:13,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-08 08:35:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-12-08 08:35:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-08 08:35:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 969 transitions. [2018-12-08 08:35:13,845 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 969 transitions. Word has length 62 [2018-12-08 08:35:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:13,845 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 969 transitions. [2018-12-08 08:35:13,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 969 transitions. [2018-12-08 08:35:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 08:35:13,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:13,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:13,847 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:13,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -930632011, now seen corresponding path program 1 times [2018-12-08 08:35:13,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:13,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:13,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 08:35:13,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:35:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:35:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:35:13,921 INFO L87 Difference]: Start difference. First operand 744 states and 969 transitions. Second operand 12 states. [2018-12-08 08:35:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:14,072 INFO L93 Difference]: Finished difference Result 766 states and 992 transitions. [2018-12-08 08:35:14,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:14,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-08 08:35:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:14,073 INFO L225 Difference]: With dead ends: 766 [2018-12-08 08:35:14,073 INFO L226 Difference]: Without dead ends: 742 [2018-12-08 08:35:14,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:35:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-08 08:35:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2018-12-08 08:35:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-08 08:35:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 964 transitions. [2018-12-08 08:35:14,108 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 964 transitions. Word has length 63 [2018-12-08 08:35:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:14,108 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 964 transitions. [2018-12-08 08:35:14,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:35:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 964 transitions. [2018-12-08 08:35:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 08:35:14,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:14,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:14,109 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:14,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash 813191735, now seen corresponding path program 1 times [2018-12-08 08:35:14,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:14,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:14,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:14,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:14,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:14,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 08:35:14,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:35:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:35:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:35:14,176 INFO L87 Difference]: Start difference. First operand 742 states and 964 transitions. Second operand 12 states. [2018-12-08 08:35:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:14,320 INFO L93 Difference]: Finished difference Result 766 states and 989 transitions. [2018-12-08 08:35:14,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:14,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-08 08:35:14,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:14,322 INFO L225 Difference]: With dead ends: 766 [2018-12-08 08:35:14,322 INFO L226 Difference]: Without dead ends: 742 [2018-12-08 08:35:14,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:35:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-08 08:35:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2018-12-08 08:35:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-12-08 08:35:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 960 transitions. [2018-12-08 08:35:14,351 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 960 transitions. Word has length 67 [2018-12-08 08:35:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:14,351 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 960 transitions. [2018-12-08 08:35:14,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:35:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 960 transitions. [2018-12-08 08:35:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 08:35:14,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:14,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:14,353 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:14,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1932048657, now seen corresponding path program 1 times [2018-12-08 08:35:14,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:14,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:14,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:14,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:14,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:14,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 08:35:14,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:35:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:35:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:35:14,427 INFO L87 Difference]: Start difference. First operand 740 states and 960 transitions. Second operand 12 states. [2018-12-08 08:35:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:14,550 INFO L93 Difference]: Finished difference Result 762 states and 983 transitions. [2018-12-08 08:35:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:14,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-08 08:35:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:14,551 INFO L225 Difference]: With dead ends: 762 [2018-12-08 08:35:14,552 INFO L226 Difference]: Without dead ends: 738 [2018-12-08 08:35:14,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:35:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-08 08:35:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 733. [2018-12-08 08:35:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-12-08 08:35:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 948 transitions. [2018-12-08 08:35:14,587 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 948 transitions. Word has length 62 [2018-12-08 08:35:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:14,587 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 948 transitions. [2018-12-08 08:35:14,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:35:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 948 transitions. [2018-12-08 08:35:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 08:35:14,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:14,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:14,588 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:14,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2018-12-08 08:35:14,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:14,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:14,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:14,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 08:35:14,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:35:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:35:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:14,669 INFO L87 Difference]: Start difference. First operand 733 states and 948 transitions. Second operand 13 states. [2018-12-08 08:35:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:14,846 INFO L93 Difference]: Finished difference Result 750 states and 966 transitions. [2018-12-08 08:35:14,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:35:14,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-08 08:35:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:14,848 INFO L225 Difference]: With dead ends: 750 [2018-12-08 08:35:14,848 INFO L226 Difference]: Without dead ends: 728 [2018-12-08 08:35:14,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:35:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-08 08:35:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-12-08 08:35:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-12-08 08:35:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 941 transitions. [2018-12-08 08:35:14,876 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 941 transitions. Word has length 63 [2018-12-08 08:35:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:14,876 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 941 transitions. [2018-12-08 08:35:14,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:35:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 941 transitions. [2018-12-08 08:35:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 08:35:14,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:14,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:14,877 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:14,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:14,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1755012540, now seen corresponding path program 1 times [2018-12-08 08:35:14,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:14,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:14,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:14,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:14,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:14,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:14,893 INFO L87 Difference]: Start difference. First operand 728 states and 941 transitions. Second operand 3 states. [2018-12-08 08:35:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:14,937 INFO L93 Difference]: Finished difference Result 858 states and 1114 transitions. [2018-12-08 08:35:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:14,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-08 08:35:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:14,939 INFO L225 Difference]: With dead ends: 858 [2018-12-08 08:35:14,939 INFO L226 Difference]: Without dead ends: 728 [2018-12-08 08:35:14,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-08 08:35:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-12-08 08:35:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-12-08 08:35:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 938 transitions. [2018-12-08 08:35:14,983 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 938 transitions. Word has length 66 [2018-12-08 08:35:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:14,983 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 938 transitions. [2018-12-08 08:35:14,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 938 transitions. [2018-12-08 08:35:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 08:35:14,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:14,984 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:14,984 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:14,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 500473129, now seen corresponding path program 1 times [2018-12-08 08:35:14,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:14,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:15,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:15,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:15,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:15,014 INFO L87 Difference]: Start difference. First operand 728 states and 938 transitions. Second operand 3 states. [2018-12-08 08:35:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:15,069 INFO L93 Difference]: Finished difference Result 937 states and 1206 transitions. [2018-12-08 08:35:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:15,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-08 08:35:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:15,072 INFO L225 Difference]: With dead ends: 937 [2018-12-08 08:35:15,072 INFO L226 Difference]: Without dead ends: 800 [2018-12-08 08:35:15,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-08 08:35:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 769. [2018-12-08 08:35:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-08 08:35:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 989 transitions. [2018-12-08 08:35:15,105 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 989 transitions. Word has length 80 [2018-12-08 08:35:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:15,106 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 989 transitions. [2018-12-08 08:35:15,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 989 transitions. [2018-12-08 08:35:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 08:35:15,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:15,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:15,107 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:15,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2018-12-08 08:35:15,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:15,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:15,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:15,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:15,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:15,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:15,135 INFO L87 Difference]: Start difference. First operand 769 states and 989 transitions. Second operand 5 states. [2018-12-08 08:35:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:15,226 INFO L93 Difference]: Finished difference Result 823 states and 1048 transitions. [2018-12-08 08:35:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:15,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-08 08:35:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:15,227 INFO L225 Difference]: With dead ends: 823 [2018-12-08 08:35:15,228 INFO L226 Difference]: Without dead ends: 771 [2018-12-08 08:35:15,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-08 08:35:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2018-12-08 08:35:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-08 08:35:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 988 transitions. [2018-12-08 08:35:15,261 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 988 transitions. Word has length 65 [2018-12-08 08:35:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:15,261 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 988 transitions. [2018-12-08 08:35:15,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 988 transitions. [2018-12-08 08:35:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 08:35:15,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:15,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:15,262 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:15,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash 21902732, now seen corresponding path program 1 times [2018-12-08 08:35:15,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:15,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:15,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:15,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:15,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:15,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:15,298 INFO L87 Difference]: Start difference. First operand 769 states and 988 transitions. Second operand 5 states. [2018-12-08 08:35:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:15,415 INFO L93 Difference]: Finished difference Result 833 states and 1063 transitions. [2018-12-08 08:35:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:15,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-08 08:35:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:15,417 INFO L225 Difference]: With dead ends: 833 [2018-12-08 08:35:15,417 INFO L226 Difference]: Without dead ends: 800 [2018-12-08 08:35:15,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-08 08:35:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 775. [2018-12-08 08:35:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-12-08 08:35:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 995 transitions. [2018-12-08 08:35:15,453 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 995 transitions. Word has length 65 [2018-12-08 08:35:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:15,453 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 995 transitions. [2018-12-08 08:35:15,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 995 transitions. [2018-12-08 08:35:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 08:35:15,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:15,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:15,454 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:15,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2018-12-08 08:35:15,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:15,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:15,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:15,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:15,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:15,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:15,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:15,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:15,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:15,523 INFO L87 Difference]: Start difference. First operand 775 states and 995 transitions. Second operand 11 states. [2018-12-08 08:35:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:15,620 INFO L93 Difference]: Finished difference Result 797 states and 1018 transitions. [2018-12-08 08:35:15,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:15,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-12-08 08:35:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:15,621 INFO L225 Difference]: With dead ends: 797 [2018-12-08 08:35:15,621 INFO L226 Difference]: Without dead ends: 771 [2018-12-08 08:35:15,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-08 08:35:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 765. [2018-12-08 08:35:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-08 08:35:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 981 transitions. [2018-12-08 08:35:15,652 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 981 transitions. Word has length 66 [2018-12-08 08:35:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:15,652 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 981 transitions. [2018-12-08 08:35:15,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 981 transitions. [2018-12-08 08:35:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 08:35:15,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:15,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:15,653 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:15,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:15,653 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2018-12-08 08:35:15,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:15,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:15,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:15,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:15,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:15,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:15,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:15,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:15,679 INFO L87 Difference]: Start difference. First operand 765 states and 981 transitions. Second operand 5 states. [2018-12-08 08:35:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:15,733 INFO L93 Difference]: Finished difference Result 806 states and 1025 transitions. [2018-12-08 08:35:15,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:15,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 08:35:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:15,734 INFO L225 Difference]: With dead ends: 806 [2018-12-08 08:35:15,734 INFO L226 Difference]: Without dead ends: 772 [2018-12-08 08:35:15,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-12-08 08:35:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 765. [2018-12-08 08:35:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-08 08:35:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 980 transitions. [2018-12-08 08:35:15,771 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 980 transitions. Word has length 67 [2018-12-08 08:35:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:15,771 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 980 transitions. [2018-12-08 08:35:15,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 980 transitions. [2018-12-08 08:35:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 08:35:15,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:15,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:15,772 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:15,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2018-12-08 08:35:15,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:15,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:15,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:15,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:15,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:15,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:15,838 INFO L87 Difference]: Start difference. First operand 765 states and 980 transitions. Second operand 6 states. [2018-12-08 08:35:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:15,910 INFO L93 Difference]: Finished difference Result 804 states and 1021 transitions. [2018-12-08 08:35:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:15,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-08 08:35:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:15,911 INFO L225 Difference]: With dead ends: 804 [2018-12-08 08:35:15,911 INFO L226 Difference]: Without dead ends: 772 [2018-12-08 08:35:15,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-12-08 08:35:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 767. [2018-12-08 08:35:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-12-08 08:35:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 982 transitions. [2018-12-08 08:35:15,941 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 982 transitions. Word has length 68 [2018-12-08 08:35:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:15,941 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 982 transitions. [2018-12-08 08:35:15,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 982 transitions. [2018-12-08 08:35:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 08:35:15,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:15,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] [2018-12-08 08:35:15,942 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:15,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash 810473489, now seen corresponding path program 1 times [2018-12-08 08:35:15,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:15,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:15,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:15,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:15,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:15,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:15,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:15,995 INFO L87 Difference]: Start difference. First operand 767 states and 982 transitions. Second operand 11 states. [2018-12-08 08:35:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:16,098 INFO L93 Difference]: Finished difference Result 792 states and 1009 transitions. [2018-12-08 08:35:16,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:16,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-08 08:35:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:16,100 INFO L225 Difference]: With dead ends: 792 [2018-12-08 08:35:16,100 INFO L226 Difference]: Without dead ends: 759 [2018-12-08 08:35:16,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-08 08:35:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-12-08 08:35:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-08 08:35:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 972 transitions. [2018-12-08 08:35:16,145 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 972 transitions. Word has length 68 [2018-12-08 08:35:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:16,145 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 972 transitions. [2018-12-08 08:35:16,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 972 transitions. [2018-12-08 08:35:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 08:35:16,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:16,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:16,146 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:16,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:16,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2018-12-08 08:35:16,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:16,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:16,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:16,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:16,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:16,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:16,190 INFO L87 Difference]: Start difference. First operand 759 states and 972 transitions. Second operand 6 states. [2018-12-08 08:35:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:16,247 INFO L93 Difference]: Finished difference Result 806 states and 1020 transitions. [2018-12-08 08:35:16,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:16,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-08 08:35:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:16,248 INFO L225 Difference]: With dead ends: 806 [2018-12-08 08:35:16,248 INFO L226 Difference]: Without dead ends: 754 [2018-12-08 08:35:16,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-12-08 08:35:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-12-08 08:35:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-12-08 08:35:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 959 transitions. [2018-12-08 08:35:16,277 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 959 transitions. Word has length 68 [2018-12-08 08:35:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:16,277 INFO L480 AbstractCegarLoop]: Abstraction has 752 states and 959 transitions. [2018-12-08 08:35:16,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 959 transitions. [2018-12-08 08:35:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 08:35:16,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:16,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:16,278 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:16,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 631462302, now seen corresponding path program 1 times [2018-12-08 08:35:16,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:16,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:16,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:16,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:16,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:16,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:16,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:16,327 INFO L87 Difference]: Start difference. First operand 752 states and 959 transitions. Second operand 11 states. [2018-12-08 08:35:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:16,403 INFO L93 Difference]: Finished difference Result 774 states and 982 transitions. [2018-12-08 08:35:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:16,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-08 08:35:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:16,405 INFO L225 Difference]: With dead ends: 774 [2018-12-08 08:35:16,405 INFO L226 Difference]: Without dead ends: 742 [2018-12-08 08:35:16,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-12-08 08:35:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-08 08:35:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2018-12-08 08:35:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-08 08:35:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 945 transitions. [2018-12-08 08:35:16,434 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 945 transitions. Word has length 68 [2018-12-08 08:35:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:16,434 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 945 transitions. [2018-12-08 08:35:16,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 945 transitions. [2018-12-08 08:35:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 08:35:16,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:16,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:16,436 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:16,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:16,436 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2018-12-08 08:35:16,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:16,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:16,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:16,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:16,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:16,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:16,458 INFO L87 Difference]: Start difference. First operand 742 states and 945 transitions. Second operand 5 states. [2018-12-08 08:35:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:16,665 INFO L93 Difference]: Finished difference Result 803 states and 1024 transitions. [2018-12-08 08:35:16,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:16,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-08 08:35:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:16,666 INFO L225 Difference]: With dead ends: 803 [2018-12-08 08:35:16,666 INFO L226 Difference]: Without dead ends: 797 [2018-12-08 08:35:16,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-12-08 08:35:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 742. [2018-12-08 08:35:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-08 08:35:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 944 transitions. [2018-12-08 08:35:16,695 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 944 transitions. Word has length 68 [2018-12-08 08:35:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:16,695 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 944 transitions. [2018-12-08 08:35:16,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 944 transitions. [2018-12-08 08:35:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:16,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:16,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:16,696 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:16,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2018-12-08 08:35:16,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:16,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:16,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:16,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:16,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:16,718 INFO L87 Difference]: Start difference. First operand 742 states and 944 transitions. Second operand 5 states. [2018-12-08 08:35:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:16,762 INFO L93 Difference]: Finished difference Result 783 states and 988 transitions. [2018-12-08 08:35:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:16,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-08 08:35:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:16,764 INFO L225 Difference]: With dead ends: 783 [2018-12-08 08:35:16,764 INFO L226 Difference]: Without dead ends: 749 [2018-12-08 08:35:16,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-08 08:35:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 742. [2018-12-08 08:35:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-08 08:35:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 943 transitions. [2018-12-08 08:35:16,793 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 943 transitions. Word has length 69 [2018-12-08 08:35:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:16,793 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 943 transitions. [2018-12-08 08:35:16,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 943 transitions. [2018-12-08 08:35:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:16,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:16,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:16,794 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:16,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2018-12-08 08:35:16,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:16,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:16,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:16,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:16,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:16,841 INFO L87 Difference]: Start difference. First operand 742 states and 943 transitions. Second operand 6 states. [2018-12-08 08:35:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:16,899 INFO L93 Difference]: Finished difference Result 781 states and 984 transitions. [2018-12-08 08:35:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:16,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-08 08:35:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:16,901 INFO L225 Difference]: With dead ends: 781 [2018-12-08 08:35:16,901 INFO L226 Difference]: Without dead ends: 749 [2018-12-08 08:35:16,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-08 08:35:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 744. [2018-12-08 08:35:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-08 08:35:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 945 transitions. [2018-12-08 08:35:16,930 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 945 transitions. Word has length 69 [2018-12-08 08:35:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:16,930 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 945 transitions. [2018-12-08 08:35:16,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 945 transitions. [2018-12-08 08:35:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:16,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:16,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:16,931 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:16,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2052556264, now seen corresponding path program 1 times [2018-12-08 08:35:16,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:16,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:16,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:16,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:16,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:16,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:16,980 INFO L87 Difference]: Start difference. First operand 744 states and 945 transitions. Second operand 11 states. [2018-12-08 08:35:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:17,069 INFO L93 Difference]: Finished difference Result 769 states and 972 transitions. [2018-12-08 08:35:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:17,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-08 08:35:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:17,070 INFO L225 Difference]: With dead ends: 769 [2018-12-08 08:35:17,070 INFO L226 Difference]: Without dead ends: 737 [2018-12-08 08:35:17,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-12-08 08:35:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2018-12-08 08:35:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-08 08:35:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 936 transitions. [2018-12-08 08:35:17,099 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 936 transitions. Word has length 69 [2018-12-08 08:35:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:17,099 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 936 transitions. [2018-12-08 08:35:17,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 936 transitions. [2018-12-08 08:35:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:17,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:17,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:17,100 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2018-12-08 08:35:17,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:17,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:17,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:17,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:17,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:17,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:17,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:17,140 INFO L87 Difference]: Start difference. First operand 737 states and 936 transitions. Second operand 6 states. [2018-12-08 08:35:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:17,193 INFO L93 Difference]: Finished difference Result 776 states and 977 transitions. [2018-12-08 08:35:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:17,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-08 08:35:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:17,194 INFO L225 Difference]: With dead ends: 776 [2018-12-08 08:35:17,194 INFO L226 Difference]: Without dead ends: 744 [2018-12-08 08:35:17,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-12-08 08:35:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 739. [2018-12-08 08:35:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-08 08:35:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 938 transitions. [2018-12-08 08:35:17,224 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 938 transitions. Word has length 69 [2018-12-08 08:35:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:17,224 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 938 transitions. [2018-12-08 08:35:17,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 938 transitions. [2018-12-08 08:35:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:17,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:17,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:17,225 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:17,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1860763099, now seen corresponding path program 1 times [2018-12-08 08:35:17,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:17,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:17,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:17,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:17,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:17,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:17,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:17,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:17,279 INFO L87 Difference]: Start difference. First operand 739 states and 938 transitions. Second operand 11 states. [2018-12-08 08:35:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:17,359 INFO L93 Difference]: Finished difference Result 764 states and 965 transitions. [2018-12-08 08:35:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:17,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-08 08:35:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:17,361 INFO L225 Difference]: With dead ends: 764 [2018-12-08 08:35:17,361 INFO L226 Difference]: Without dead ends: 734 [2018-12-08 08:35:17,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-08 08:35:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-08 08:35:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-08 08:35:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 931 transitions. [2018-12-08 08:35:17,398 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 931 transitions. Word has length 69 [2018-12-08 08:35:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:17,398 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 931 transitions. [2018-12-08 08:35:17,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 931 transitions. [2018-12-08 08:35:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:17,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:17,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:17,399 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:17,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2018-12-08 08:35:17,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:17,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:17,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:17,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:17,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:17,471 INFO L87 Difference]: Start difference. First operand 734 states and 931 transitions. Second operand 11 states. [2018-12-08 08:35:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:17,606 INFO L93 Difference]: Finished difference Result 744 states and 940 transitions. [2018-12-08 08:35:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:17,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-08 08:35:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:17,608 INFO L225 Difference]: With dead ends: 744 [2018-12-08 08:35:17,608 INFO L226 Difference]: Without dead ends: 738 [2018-12-08 08:35:17,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-08 08:35:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 732. [2018-12-08 08:35:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-12-08 08:35:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 927 transitions. [2018-12-08 08:35:17,637 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 927 transitions. Word has length 69 [2018-12-08 08:35:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:17,637 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 927 transitions. [2018-12-08 08:35:17,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 927 transitions. [2018-12-08 08:35:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:17,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:17,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:17,638 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:17,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2018-12-08 08:35:17,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:17,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:17,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:17,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:17,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:17,662 INFO L87 Difference]: Start difference. First operand 732 states and 927 transitions. Second operand 5 states. [2018-12-08 08:35:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:17,905 INFO L93 Difference]: Finished difference Result 789 states and 1002 transitions. [2018-12-08 08:35:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:17,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-08 08:35:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:17,906 INFO L225 Difference]: With dead ends: 789 [2018-12-08 08:35:17,906 INFO L226 Difference]: Without dead ends: 727 [2018-12-08 08:35:17,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-08 08:35:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 676. [2018-12-08 08:35:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-12-08 08:35:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 856 transitions. [2018-12-08 08:35:17,940 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 856 transitions. Word has length 69 [2018-12-08 08:35:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:17,940 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 856 transitions. [2018-12-08 08:35:17,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 856 transitions. [2018-12-08 08:35:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 08:35:17,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:17,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:17,941 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:17,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash -900473525, now seen corresponding path program 1 times [2018-12-08 08:35:17,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:17,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:18,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:18,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 08:35:18,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:35:18,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:35:18,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:35:18,025 INFO L87 Difference]: Start difference. First operand 676 states and 856 transitions. Second operand 12 states. [2018-12-08 08:35:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:18,134 INFO L93 Difference]: Finished difference Result 704 states and 888 transitions. [2018-12-08 08:35:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:18,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-08 08:35:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:18,135 INFO L225 Difference]: With dead ends: 704 [2018-12-08 08:35:18,135 INFO L226 Difference]: Without dead ends: 681 [2018-12-08 08:35:18,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:35:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-12-08 08:35:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-12-08 08:35:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-12-08 08:35:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 863 transitions. [2018-12-08 08:35:18,162 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 863 transitions. Word has length 70 [2018-12-08 08:35:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:18,162 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 863 transitions. [2018-12-08 08:35:18,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:35:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 863 transitions. [2018-12-08 08:35:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 08:35:18,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:18,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:18,163 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash 459038371, now seen corresponding path program 1 times [2018-12-08 08:35:18,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:18,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:18,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:18,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 08:35:18,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:35:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:35:18,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:18,223 INFO L87 Difference]: Start difference. First operand 681 states and 863 transitions. Second operand 7 states. [2018-12-08 08:35:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:18,319 INFO L93 Difference]: Finished difference Result 727 states and 910 transitions. [2018-12-08 08:35:18,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 08:35:18,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-08 08:35:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:18,321 INFO L225 Difference]: With dead ends: 727 [2018-12-08 08:35:18,321 INFO L226 Difference]: Without dead ends: 682 [2018-12-08 08:35:18,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:35:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-08 08:35:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-12-08 08:35:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-08 08:35:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 859 transitions. [2018-12-08 08:35:18,349 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 859 transitions. Word has length 74 [2018-12-08 08:35:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:18,349 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 859 transitions. [2018-12-08 08:35:18,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:35:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 859 transitions. [2018-12-08 08:35:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 08:35:18,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:18,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:18,350 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:18,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1160638245, now seen corresponding path program 1 times [2018-12-08 08:35:18,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:18,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:18,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:18,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:18,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:18,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 08:35:18,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:35:18,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:35:18,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:35:18,425 INFO L87 Difference]: Start difference. First operand 680 states and 859 transitions. Second operand 14 states. [2018-12-08 08:35:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:18,555 INFO L93 Difference]: Finished difference Result 702 states and 882 transitions. [2018-12-08 08:35:18,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:35:18,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-08 08:35:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:18,557 INFO L225 Difference]: With dead ends: 702 [2018-12-08 08:35:18,557 INFO L226 Difference]: Without dead ends: 670 [2018-12-08 08:35:18,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:35:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-08 08:35:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-12-08 08:35:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-12-08 08:35:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 844 transitions. [2018-12-08 08:35:18,599 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 844 transitions. Word has length 74 [2018-12-08 08:35:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:18,600 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 844 transitions. [2018-12-08 08:35:18,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:35:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 844 transitions. [2018-12-08 08:35:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 08:35:18,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:18,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:18,601 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:18,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash -198873651, now seen corresponding path program 1 times [2018-12-08 08:35:18,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:18,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:18,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:18,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 08:35:18,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:35:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:35:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:35:18,687 INFO L87 Difference]: Start difference. First operand 670 states and 844 transitions. Second operand 14 states. [2018-12-08 08:35:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:18,808 INFO L93 Difference]: Finished difference Result 694 states and 870 transitions. [2018-12-08 08:35:18,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:35:18,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-08 08:35:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:18,809 INFO L225 Difference]: With dead ends: 694 [2018-12-08 08:35:18,809 INFO L226 Difference]: Without dead ends: 667 [2018-12-08 08:35:18,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:35:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-12-08 08:35:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-12-08 08:35:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-12-08 08:35:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 839 transitions. [2018-12-08 08:35:18,836 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 839 transitions. Word has length 70 [2018-12-08 08:35:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:18,836 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 839 transitions. [2018-12-08 08:35:18,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:35:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 839 transitions. [2018-12-08 08:35:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 08:35:18,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:18,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:18,837 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:18,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2018-12-08 08:35:18,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:18,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:18,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:18,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:18,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:18,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 08:35:18,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:35:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:35:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:18,935 INFO L87 Difference]: Start difference. First operand 667 states and 839 transitions. Second operand 13 states. [2018-12-08 08:35:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:19,089 INFO L93 Difference]: Finished difference Result 684 states and 857 transitions. [2018-12-08 08:35:19,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:35:19,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-08 08:35:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:19,090 INFO L225 Difference]: With dead ends: 684 [2018-12-08 08:35:19,090 INFO L226 Difference]: Without dead ends: 655 [2018-12-08 08:35:19,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:35:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-08 08:35:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2018-12-08 08:35:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-12-08 08:35:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 823 transitions. [2018-12-08 08:35:19,117 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 823 transitions. Word has length 69 [2018-12-08 08:35:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:19,117 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 823 transitions. [2018-12-08 08:35:19,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:35:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 823 transitions. [2018-12-08 08:35:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 08:35:19,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:19,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:19,118 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:19,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1712334254, now seen corresponding path program 1 times [2018-12-08 08:35:19,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:19,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:19,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:19,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:19,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:19,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:19,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:19,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:19,138 INFO L87 Difference]: Start difference. First operand 655 states and 823 transitions. Second operand 5 states. [2018-12-08 08:35:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:19,175 INFO L93 Difference]: Finished difference Result 702 states and 872 transitions. [2018-12-08 08:35:19,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:19,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-08 08:35:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:19,176 INFO L225 Difference]: With dead ends: 702 [2018-12-08 08:35:19,176 INFO L226 Difference]: Without dead ends: 659 [2018-12-08 08:35:19,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-08 08:35:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2018-12-08 08:35:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-12-08 08:35:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 822 transitions. [2018-12-08 08:35:19,205 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 822 transitions. Word has length 71 [2018-12-08 08:35:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:19,205 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 822 transitions. [2018-12-08 08:35:19,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 822 transitions. [2018-12-08 08:35:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 08:35:19,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:19,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:19,206 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:19,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash -531649044, now seen corresponding path program 1 times [2018-12-08 08:35:19,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:19,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:19,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 08:35:19,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:35:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:35:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:35:19,288 INFO L87 Difference]: Start difference. First operand 655 states and 822 transitions. Second operand 14 states. [2018-12-08 08:35:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:19,432 INFO L93 Difference]: Finished difference Result 679 states and 848 transitions. [2018-12-08 08:35:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:35:19,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-08 08:35:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:19,433 INFO L225 Difference]: With dead ends: 679 [2018-12-08 08:35:19,433 INFO L226 Difference]: Without dead ends: 648 [2018-12-08 08:35:19,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:35:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-12-08 08:35:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2018-12-08 08:35:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-08 08:35:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 812 transitions. [2018-12-08 08:35:19,459 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 812 transitions. Word has length 71 [2018-12-08 08:35:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:19,459 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 812 transitions. [2018-12-08 08:35:19,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:35:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 812 transitions. [2018-12-08 08:35:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 08:35:19,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:19,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:19,460 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:19,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906513, now seen corresponding path program 1 times [2018-12-08 08:35:19,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:19,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:19,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:19,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:19,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 08:35:19,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:35:19,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:35:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:35:19,527 INFO L87 Difference]: Start difference. First operand 648 states and 812 transitions. Second operand 14 states. [2018-12-08 08:35:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:19,634 INFO L93 Difference]: Finished difference Result 712 states and 880 transitions. [2018-12-08 08:35:19,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:35:19,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-08 08:35:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:19,635 INFO L225 Difference]: With dead ends: 712 [2018-12-08 08:35:19,635 INFO L226 Difference]: Without dead ends: 642 [2018-12-08 08:35:19,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:35:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-08 08:35:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2018-12-08 08:35:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-12-08 08:35:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 803 transitions. [2018-12-08 08:35:19,661 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 803 transitions. Word has length 71 [2018-12-08 08:35:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:19,662 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 803 transitions. [2018-12-08 08:35:19,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:35:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 803 transitions. [2018-12-08 08:35:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 08:35:19,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:19,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:19,662 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:19,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:19,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2018-12-08 08:35:19,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:19,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:19,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:19,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:19,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:19,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:19,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:19,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:19,706 INFO L87 Difference]: Start difference. First operand 642 states and 803 transitions. Second operand 11 states. [2018-12-08 08:35:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:19,798 INFO L93 Difference]: Finished difference Result 669 states and 833 transitions. [2018-12-08 08:35:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:19,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-12-08 08:35:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:19,799 INFO L225 Difference]: With dead ends: 669 [2018-12-08 08:35:19,799 INFO L226 Difference]: Without dead ends: 624 [2018-12-08 08:35:19,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-12-08 08:35:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2018-12-08 08:35:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-12-08 08:35:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 775 transitions. [2018-12-08 08:35:19,825 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 775 transitions. Word has length 72 [2018-12-08 08:35:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 775 transitions. [2018-12-08 08:35:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 775 transitions. [2018-12-08 08:35:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 08:35:19,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:19,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:19,826 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:19,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2018-12-08 08:35:19,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:19,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:19,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:19,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:19,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:19,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:19,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:19,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:19,873 INFO L87 Difference]: Start difference. First operand 624 states and 775 transitions. Second operand 6 states. [2018-12-08 08:35:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:19,928 INFO L93 Difference]: Finished difference Result 665 states and 819 transitions. [2018-12-08 08:35:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:19,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-08 08:35:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:19,929 INFO L225 Difference]: With dead ends: 665 [2018-12-08 08:35:19,929 INFO L226 Difference]: Without dead ends: 629 [2018-12-08 08:35:19,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-12-08 08:35:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 624. [2018-12-08 08:35:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-12-08 08:35:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 773 transitions. [2018-12-08 08:35:19,955 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 773 transitions. Word has length 71 [2018-12-08 08:35:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:19,955 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 773 transitions. [2018-12-08 08:35:19,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 773 transitions. [2018-12-08 08:35:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 08:35:19,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:19,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:19,956 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 792976728, now seen corresponding path program 1 times [2018-12-08 08:35:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:20,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:20,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:20,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:20,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:20,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:20,006 INFO L87 Difference]: Start difference. First operand 624 states and 773 transitions. Second operand 11 states. [2018-12-08 08:35:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:20,086 INFO L93 Difference]: Finished difference Result 649 states and 800 transitions. [2018-12-08 08:35:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:20,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-08 08:35:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:20,087 INFO L225 Difference]: With dead ends: 649 [2018-12-08 08:35:20,087 INFO L226 Difference]: Without dead ends: 616 [2018-12-08 08:35:20,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-12-08 08:35:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2018-12-08 08:35:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-08 08:35:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 762 transitions. [2018-12-08 08:35:20,112 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 762 transitions. Word has length 71 [2018-12-08 08:35:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:20,112 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 762 transitions. [2018-12-08 08:35:20,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 762 transitions. [2018-12-08 08:35:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 08:35:20,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:20,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:20,113 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:20,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1953714458, now seen corresponding path program 1 times [2018-12-08 08:35:20,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:20,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:20,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:20,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 08:35:20,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:35:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:35:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:20,159 INFO L87 Difference]: Start difference. First operand 616 states and 762 transitions. Second operand 7 states. [2018-12-08 08:35:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:20,223 INFO L93 Difference]: Finished difference Result 670 states and 823 transitions. [2018-12-08 08:35:20,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 08:35:20,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-08 08:35:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:20,224 INFO L225 Difference]: With dead ends: 670 [2018-12-08 08:35:20,225 INFO L226 Difference]: Without dead ends: 614 [2018-12-08 08:35:20,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:35:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-12-08 08:35:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2018-12-08 08:35:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-08 08:35:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 752 transitions. [2018-12-08 08:35:20,250 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 752 transitions. Word has length 77 [2018-12-08 08:35:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:20,250 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 752 transitions. [2018-12-08 08:35:20,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:35:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 752 transitions. [2018-12-08 08:35:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 08:35:20,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:20,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:20,251 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:20,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1353976224, now seen corresponding path program 1 times [2018-12-08 08:35:20,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:20,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:20,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:20,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:20,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:20,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 08:35:20,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:35:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:35:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:35:20,327 INFO L87 Difference]: Start difference. First operand 610 states and 752 transitions. Second operand 14 states. [2018-12-08 08:35:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:20,452 INFO L93 Difference]: Finished difference Result 669 states and 814 transitions. [2018-12-08 08:35:20,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:35:20,452 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-08 08:35:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:20,453 INFO L225 Difference]: With dead ends: 669 [2018-12-08 08:35:20,453 INFO L226 Difference]: Without dead ends: 598 [2018-12-08 08:35:20,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:35:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-12-08 08:35:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2018-12-08 08:35:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-12-08 08:35:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 733 transitions. [2018-12-08 08:35:20,478 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 733 transitions. Word has length 72 [2018-12-08 08:35:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:20,478 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 733 transitions. [2018-12-08 08:35:20,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:35:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 733 transitions. [2018-12-08 08:35:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 08:35:20,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:20,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:20,479 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:20,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2018-12-08 08:35:20,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:20,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:20,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:20,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:20,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:20,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 08:35:20,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:35:20,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:35:20,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:20,563 INFO L87 Difference]: Start difference. First operand 598 states and 733 transitions. Second operand 13 states. [2018-12-08 08:35:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:20,700 INFO L93 Difference]: Finished difference Result 618 states and 754 transitions. [2018-12-08 08:35:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:35:20,701 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-12-08 08:35:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:20,702 INFO L225 Difference]: With dead ends: 618 [2018-12-08 08:35:20,702 INFO L226 Difference]: Without dead ends: 593 [2018-12-08 08:35:20,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:35:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-12-08 08:35:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2018-12-08 08:35:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-12-08 08:35:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 725 transitions. [2018-12-08 08:35:20,726 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 725 transitions. Word has length 79 [2018-12-08 08:35:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:20,727 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 725 transitions. [2018-12-08 08:35:20,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:35:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 725 transitions. [2018-12-08 08:35:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 08:35:20,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:20,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:20,727 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:20,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2018-12-08 08:35:20,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:20,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:20,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:20,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 08:35:20,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:35:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:35:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:20,817 INFO L87 Difference]: Start difference. First operand 593 states and 725 transitions. Second operand 13 states. [2018-12-08 08:35:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:20,947 INFO L93 Difference]: Finished difference Result 595 states and 726 transitions. [2018-12-08 08:35:20,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:35:20,947 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-08 08:35:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:20,948 INFO L225 Difference]: With dead ends: 595 [2018-12-08 08:35:20,948 INFO L226 Difference]: Without dead ends: 540 [2018-12-08 08:35:20,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:35:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-12-08 08:35:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-12-08 08:35:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-12-08 08:35:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 667 transitions. [2018-12-08 08:35:20,971 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 667 transitions. Word has length 72 [2018-12-08 08:35:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:20,971 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 667 transitions. [2018-12-08 08:35:20,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:35:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2018-12-08 08:35:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 08:35:20,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:20,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:20,972 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:20,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2018-12-08 08:35:20,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:20,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:21,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:21,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 08:35:21,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:35:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:35:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:35:21,034 INFO L87 Difference]: Start difference. First operand 540 states and 667 transitions. Second operand 10 states. [2018-12-08 08:35:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:21,745 INFO L93 Difference]: Finished difference Result 1064 states and 1317 transitions. [2018-12-08 08:35:21,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 08:35:21,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-08 08:35:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:21,747 INFO L225 Difference]: With dead ends: 1064 [2018-12-08 08:35:21,747 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 08:35:21,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-08 08:35:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 08:35:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 848. [2018-12-08 08:35:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-08 08:35:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1071 transitions. [2018-12-08 08:35:21,785 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1071 transitions. Word has length 73 [2018-12-08 08:35:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:21,785 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1071 transitions. [2018-12-08 08:35:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:35:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1071 transitions. [2018-12-08 08:35:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 08:35:21,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:21,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:21,786 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:21,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2018-12-08 08:35:21,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:21,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:21,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:21,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:21,816 INFO L87 Difference]: Start difference. First operand 848 states and 1071 transitions. Second operand 6 states. [2018-12-08 08:35:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:22,144 INFO L93 Difference]: Finished difference Result 1067 states and 1315 transitions. [2018-12-08 08:35:22,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 08:35:22,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-08 08:35:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:22,145 INFO L225 Difference]: With dead ends: 1067 [2018-12-08 08:35:22,145 INFO L226 Difference]: Without dead ends: 962 [2018-12-08 08:35:22,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-12-08 08:35:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 918. [2018-12-08 08:35:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-12-08 08:35:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1151 transitions. [2018-12-08 08:35:22,189 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1151 transitions. Word has length 73 [2018-12-08 08:35:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:22,189 INFO L480 AbstractCegarLoop]: Abstraction has 918 states and 1151 transitions. [2018-12-08 08:35:22,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1151 transitions. [2018-12-08 08:35:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 08:35:22,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:22,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:22,190 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:22,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:22,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1694643791, now seen corresponding path program 1 times [2018-12-08 08:35:22,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:22,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:22,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-12-08 08:35:22,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:22,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:22,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:22,251 INFO L87 Difference]: Start difference. First operand 918 states and 1151 transitions. Second operand 6 states. [2018-12-08 08:35:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:22,334 INFO L93 Difference]: Finished difference Result 1192 states and 1507 transitions. [2018-12-08 08:35:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:22,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 08:35:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:22,336 INFO L225 Difference]: With dead ends: 1192 [2018-12-08 08:35:22,336 INFO L226 Difference]: Without dead ends: 904 [2018-12-08 08:35:22,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-08 08:35:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-08 08:35:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-08 08:35:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1129 transitions. [2018-12-08 08:35:22,383 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1129 transitions. Word has length 77 [2018-12-08 08:35:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:22,383 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1129 transitions. [2018-12-08 08:35:22,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1129 transitions. [2018-12-08 08:35:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 08:35:22,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:22,384 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:22,384 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:22,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2018-12-08 08:35:22,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:22,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:35:22,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:22,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:22,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:22,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:22,415 INFO L87 Difference]: Start difference. First operand 904 states and 1129 transitions. Second operand 5 states. [2018-12-08 08:35:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:22,464 INFO L93 Difference]: Finished difference Result 949 states and 1177 transitions. [2018-12-08 08:35:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:22,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-08 08:35:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:22,465 INFO L225 Difference]: With dead ends: 949 [2018-12-08 08:35:22,465 INFO L226 Difference]: Without dead ends: 904 [2018-12-08 08:35:22,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-08 08:35:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-08 08:35:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-08 08:35:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1127 transitions. [2018-12-08 08:35:22,509 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1127 transitions. Word has length 75 [2018-12-08 08:35:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:22,509 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1127 transitions. [2018-12-08 08:35:22,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1127 transitions. [2018-12-08 08:35:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 08:35:22,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:22,510 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:22,510 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:22,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash -509505287, now seen corresponding path program 1 times [2018-12-08 08:35:22,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:22,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:22,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:35:22,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:22,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:22,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:22,548 INFO L87 Difference]: Start difference. First operand 904 states and 1127 transitions. Second operand 6 states. [2018-12-08 08:35:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:22,605 INFO L93 Difference]: Finished difference Result 945 states and 1169 transitions. [2018-12-08 08:35:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:35:22,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-08 08:35:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:22,607 INFO L225 Difference]: With dead ends: 945 [2018-12-08 08:35:22,607 INFO L226 Difference]: Without dead ends: 904 [2018-12-08 08:35:22,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-08 08:35:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-08 08:35:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-08 08:35:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1125 transitions. [2018-12-08 08:35:22,650 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1125 transitions. Word has length 75 [2018-12-08 08:35:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:22,650 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1125 transitions. [2018-12-08 08:35:22,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1125 transitions. [2018-12-08 08:35:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 08:35:22,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:22,651 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:22,651 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:22,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978377, now seen corresponding path program 1 times [2018-12-08 08:35:22,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:22,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:22,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:35:22,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:22,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:22,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:22,703 INFO L87 Difference]: Start difference. First operand 904 states and 1125 transitions. Second operand 11 states. [2018-12-08 08:35:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:22,789 INFO L93 Difference]: Finished difference Result 926 states and 1148 transitions. [2018-12-08 08:35:22,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:22,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-12-08 08:35:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:22,791 INFO L225 Difference]: With dead ends: 926 [2018-12-08 08:35:22,791 INFO L226 Difference]: Without dead ends: 857 [2018-12-08 08:35:22,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-12-08 08:35:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 851. [2018-12-08 08:35:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-08 08:35:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1062 transitions. [2018-12-08 08:35:22,833 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1062 transitions. Word has length 75 [2018-12-08 08:35:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:22,833 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1062 transitions. [2018-12-08 08:35:22,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1062 transitions. [2018-12-08 08:35:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 08:35:22,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:22,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:22,834 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:22,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:22,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922871, now seen corresponding path program 1 times [2018-12-08 08:35:22,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:22,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:22,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:22,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:22,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:22,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:22,859 INFO L87 Difference]: Start difference. First operand 851 states and 1062 transitions. Second operand 3 states. [2018-12-08 08:35:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:22,931 INFO L93 Difference]: Finished difference Result 914 states and 1130 transitions. [2018-12-08 08:35:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:22,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-08 08:35:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:22,933 INFO L225 Difference]: With dead ends: 914 [2018-12-08 08:35:22,933 INFO L226 Difference]: Without dead ends: 861 [2018-12-08 08:35:22,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-12-08 08:35:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 853. [2018-12-08 08:35:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-12-08 08:35:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1064 transitions. [2018-12-08 08:35:22,993 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1064 transitions. Word has length 80 [2018-12-08 08:35:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:22,993 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1064 transitions. [2018-12-08 08:35:22,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1064 transitions. [2018-12-08 08:35:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 08:35:22,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:22,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:22,994 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:22,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash 327061127, now seen corresponding path program 1 times [2018-12-08 08:35:22,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:22,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:22,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:22,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:23,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:23,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 08:35:23,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:35:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:35:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:35:23,061 INFO L87 Difference]: Start difference. First operand 853 states and 1064 transitions. Second operand 14 states. [2018-12-08 08:35:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:23,192 INFO L93 Difference]: Finished difference Result 881 states and 1093 transitions. [2018-12-08 08:35:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:35:23,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-12-08 08:35:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:23,194 INFO L225 Difference]: With dead ends: 881 [2018-12-08 08:35:23,194 INFO L226 Difference]: Without dead ends: 841 [2018-12-08 08:35:23,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:35:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-12-08 08:35:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2018-12-08 08:35:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-12-08 08:35:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1044 transitions. [2018-12-08 08:35:23,234 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1044 transitions. Word has length 80 [2018-12-08 08:35:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:23,234 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1044 transitions. [2018-12-08 08:35:23,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:35:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1044 transitions. [2018-12-08 08:35:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 08:35:23,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:23,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:23,235 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:23,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1252114584, now seen corresponding path program 1 times [2018-12-08 08:35:23,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:23,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:23,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:23,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:23,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 08:35:23,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:35:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:35:23,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:35:23,305 INFO L87 Difference]: Start difference. First operand 841 states and 1044 transitions. Second operand 14 states. [2018-12-08 08:35:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:23,418 INFO L93 Difference]: Finished difference Result 856 states and 1060 transitions. [2018-12-08 08:35:23,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:35:23,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-12-08 08:35:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:23,420 INFO L225 Difference]: With dead ends: 856 [2018-12-08 08:35:23,420 INFO L226 Difference]: Without dead ends: 741 [2018-12-08 08:35:23,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:35:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-12-08 08:35:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 463. [2018-12-08 08:35:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-12-08 08:35:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 563 transitions. [2018-12-08 08:35:23,445 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 563 transitions. Word has length 77 [2018-12-08 08:35:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:23,445 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 563 transitions. [2018-12-08 08:35:23,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:35:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 563 transitions. [2018-12-08 08:35:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 08:35:23,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:23,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:23,446 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:23,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -235814922, now seen corresponding path program 1 times [2018-12-08 08:35:23,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:23,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:23,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:23,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:23,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:35:23,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:35:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:35:23,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:35:23,467 INFO L87 Difference]: Start difference. First operand 463 states and 563 transitions. Second operand 5 states. [2018-12-08 08:35:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:23,577 INFO L93 Difference]: Finished difference Result 597 states and 735 transitions. [2018-12-08 08:35:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:23,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-08 08:35:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:23,578 INFO L225 Difference]: With dead ends: 597 [2018-12-08 08:35:23,578 INFO L226 Difference]: Without dead ends: 447 [2018-12-08 08:35:23,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:35:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-08 08:35:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-12-08 08:35:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-08 08:35:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 543 transitions. [2018-12-08 08:35:23,602 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 543 transitions. Word has length 81 [2018-12-08 08:35:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:23,603 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 543 transitions. [2018-12-08 08:35:23,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:35:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 543 transitions. [2018-12-08 08:35:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 08:35:23,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:23,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:23,604 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:23,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2018-12-08 08:35:23,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:23,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:23,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 08:35:23,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:35:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:35:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:35:23,673 INFO L87 Difference]: Start difference. First operand 447 states and 543 transitions. Second operand 10 states. [2018-12-08 08:35:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:24,286 INFO L93 Difference]: Finished difference Result 759 states and 932 transitions. [2018-12-08 08:35:24,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:24,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-08 08:35:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:24,287 INFO L225 Difference]: With dead ends: 759 [2018-12-08 08:35:24,287 INFO L226 Difference]: Without dead ends: 622 [2018-12-08 08:35:24,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:35:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-12-08 08:35:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 310. [2018-12-08 08:35:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-08 08:35:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2018-12-08 08:35:24,309 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 78 [2018-12-08 08:35:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:24,310 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2018-12-08 08:35:24,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:35:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2018-12-08 08:35:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 08:35:24,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:24,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:24,310 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:24,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:24,310 INFO L82 PathProgramCache]: Analyzing trace with hash 121497713, now seen corresponding path program 1 times [2018-12-08 08:35:24,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:24,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:24,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:24,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:24,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:24,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:24,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 08:35:24,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:35:24,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:35:24,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:35:24,334 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2018-12-08 08:35:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:24,467 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2018-12-08 08:35:24,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 08:35:24,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 08:35:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:24,467 INFO L225 Difference]: With dead ends: 445 [2018-12-08 08:35:24,467 INFO L226 Difference]: Without dead ends: 303 [2018-12-08 08:35:24,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:35:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-08 08:35:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2018-12-08 08:35:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-08 08:35:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2018-12-08 08:35:24,485 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2018-12-08 08:35:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:24,485 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2018-12-08 08:35:24,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:35:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2018-12-08 08:35:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 08:35:24,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:24,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:24,485 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:24,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1235629862, now seen corresponding path program 1 times [2018-12-08 08:35:24,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:24,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:24,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:24,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:24,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:24,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 08:35:24,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:35:24,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:35:24,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:35:24,561 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2018-12-08 08:35:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:25,003 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-12-08 08:35:25,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:35:25,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-12-08 08:35:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:25,004 INFO L225 Difference]: With dead ends: 289 [2018-12-08 08:35:25,004 INFO L226 Difference]: Without dead ends: 266 [2018-12-08 08:35:25,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-08 08:35:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-08 08:35:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-12-08 08:35:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-08 08:35:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-12-08 08:35:25,021 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2018-12-08 08:35:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:25,021 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-12-08 08:35:25,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:35:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-12-08 08:35:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 08:35:25,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:25,022 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:25,022 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:25,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash 31808508, now seen corresponding path program 1 times [2018-12-08 08:35:25,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:25,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:25,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:25,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:25,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:35:25,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:35:25,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:35:25,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:25,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:35:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:35:25,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:35:25,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 08:35:25,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 08:35:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 08:35:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:35:25,236 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 8 states. [2018-12-08 08:35:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:25,398 INFO L93 Difference]: Finished difference Result 410 states and 482 transitions. [2018-12-08 08:35:25,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:35:25,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2018-12-08 08:35:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:25,400 INFO L225 Difference]: With dead ends: 410 [2018-12-08 08:35:25,400 INFO L226 Difference]: Without dead ends: 246 [2018-12-08 08:35:25,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-08 08:35:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-12-08 08:35:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-12-08 08:35:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 283 transitions. [2018-12-08 08:35:25,427 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 283 transitions. Word has length 114 [2018-12-08 08:35:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:25,427 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 283 transitions. [2018-12-08 08:35:25,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 08:35:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 283 transitions. [2018-12-08 08:35:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 08:35:25,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:25,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:25,428 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:25,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash -642637310, now seen corresponding path program 1 times [2018-12-08 08:35:25,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:25,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:25,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:25,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:25,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:25,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:25,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 08:35:25,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:35:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:35:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:35:25,486 INFO L87 Difference]: Start difference. First operand 246 states and 283 transitions. Second operand 10 states. [2018-12-08 08:35:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:26,128 INFO L93 Difference]: Finished difference Result 529 states and 607 transitions. [2018-12-08 08:35:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 08:35:26,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-12-08 08:35:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:26,130 INFO L225 Difference]: With dead ends: 529 [2018-12-08 08:35:26,130 INFO L226 Difference]: Without dead ends: 423 [2018-12-08 08:35:26,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-12-08 08:35:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-08 08:35:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 365. [2018-12-08 08:35:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-08 08:35:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 416 transitions. [2018-12-08 08:35:26,174 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 416 transitions. Word has length 101 [2018-12-08 08:35:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:26,174 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 416 transitions. [2018-12-08 08:35:26,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:35:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 416 transitions. [2018-12-08 08:35:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 08:35:26,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:26,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:26,175 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:26,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1234425920, now seen corresponding path program 1 times [2018-12-08 08:35:26,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:26,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:26,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:35:26,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:26,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 08:35:26,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 08:35:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 08:35:26,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:35:26,210 INFO L87 Difference]: Start difference. First operand 365 states and 416 transitions. Second operand 8 states. [2018-12-08 08:35:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:26,281 INFO L93 Difference]: Finished difference Result 383 states and 435 transitions. [2018-12-08 08:35:26,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 08:35:26,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-12-08 08:35:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:26,282 INFO L225 Difference]: With dead ends: 383 [2018-12-08 08:35:26,282 INFO L226 Difference]: Without dead ends: 277 [2018-12-08 08:35:26,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-08 08:35:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 147. [2018-12-08 08:35:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-08 08:35:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-12-08 08:35:26,307 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 101 [2018-12-08 08:35:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:26,307 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-12-08 08:35:26,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 08:35:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-12-08 08:35:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 08:35:26,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:26,308 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:26,308 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:26,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash -906281704, now seen corresponding path program 1 times [2018-12-08 08:35:26,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:26,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:26,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:26,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:26,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 08:35:26,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:26,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:26,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:26,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:26,392 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-12-08 08:35:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:26,689 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-12-08 08:35:26,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:35:26,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-12-08 08:35:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:26,690 INFO L225 Difference]: With dead ends: 169 [2018-12-08 08:35:26,690 INFO L226 Difference]: Without dead ends: 146 [2018-12-08 08:35:26,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-08 08:35:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-08 08:35:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-08 08:35:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-08 08:35:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-12-08 08:35:26,713 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-12-08 08:35:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:26,713 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-12-08 08:35:26,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-12-08 08:35:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 08:35:26,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:26,714 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:26,714 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:26,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1647320713, now seen corresponding path program 1 times [2018-12-08 08:35:26,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:26,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:26,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:26,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:26,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 08:35:26,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:26,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 08:35:26,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 08:35:26,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:35:26,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:35:26,774 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-12-08 08:35:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:27,069 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-12-08 08:35:27,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 08:35:27,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-12-08 08:35:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:27,070 INFO L225 Difference]: With dead ends: 280 [2018-12-08 08:35:27,070 INFO L226 Difference]: Without dead ends: 146 [2018-12-08 08:35:27,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-08 08:35:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-08 08:35:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-08 08:35:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-08 08:35:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-12-08 08:35:27,085 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-12-08 08:35:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:27,085 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-12-08 08:35:27,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 08:35:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-12-08 08:35:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 08:35:27,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:27,086 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:27,086 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:27,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:27,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1528879239, now seen corresponding path program 1 times [2018-12-08 08:35:27,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:27,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 08:35:27,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:27,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:35:27,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:35:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:35:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:35:27,109 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-12-08 08:35:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:27,127 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-12-08 08:35:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:35:27,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-08 08:35:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:27,127 INFO L225 Difference]: With dead ends: 192 [2018-12-08 08:35:27,128 INFO L226 Difference]: Without dead ends: 158 [2018-12-08 08:35:27,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-12-08 08:35:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-08 08:35:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-12-08 08:35:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-08 08:35:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-12-08 08:35:27,141 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-12-08 08:35:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:27,141 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-12-08 08:35:27,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:35:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-12-08 08:35:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 08:35:27,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:35:27,142 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:35:27,142 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:35:27,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:35:27,142 INFO L82 PathProgramCache]: Analyzing trace with hash -142675845, now seen corresponding path program 1 times [2018-12-08 08:35:27,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:35:27,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:35:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:27,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:35:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:35:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:35:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 08:35:27,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:35:27,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 08:35:27,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:35:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:35:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:35:27,195 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 11 states. [2018-12-08 08:35:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:35:27,456 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-12-08 08:35:27,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:35:27,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-12-08 08:35:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:35:27,457 INFO L225 Difference]: With dead ends: 152 [2018-12-08 08:35:27,457 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 08:35:27,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-08 08:35:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 08:35:27,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 08:35:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 08:35:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 08:35:27,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-12-08 08:35:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:35:27,458 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:35:27,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:35:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:35:27,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 08:35:27,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 08:35:27,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:27,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:28,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:35:29,451 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 1 [2018-12-08 08:35:29,802 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2018-12-08 08:35:29,941 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-08 08:35:30,303 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 98 [2018-12-08 08:35:30,600 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2018-12-08 08:35:30,914 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-12-08 08:35:31,256 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 96 [2018-12-08 08:35:31,363 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2018-12-08 08:35:31,574 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-12-08 08:35:33,005 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2018-12-08 08:35:33,251 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-12-08 08:35:33,606 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 59 [2018-12-08 08:35:34,547 WARN L180 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 92 [2018-12-08 08:35:35,488 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 62 [2018-12-08 08:35:36,177 WARN L180 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2018-12-08 08:35:37,397 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 123 DAG size of output: 73 [2018-12-08 08:35:37,616 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70 [2018-12-08 08:35:38,536 WARN L180 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 102 [2018-12-08 08:35:38,742 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-12-08 08:35:39,408 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 72 [2018-12-08 08:35:39,592 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2018-12-08 08:35:40,063 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-12-08 08:35:41,774 WARN L180 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2018-12-08 08:35:43,656 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 234 DAG size of output: 101 [2018-12-08 08:35:44,084 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 69 [2018-12-08 08:35:44,328 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-12-08 08:35:45,483 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 136 DAG size of output: 85 [2018-12-08 08:35:46,555 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2018-12-08 08:35:46,991 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2018-12-08 08:35:47,427 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 73 [2018-12-08 08:35:47,580 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 68 [2018-12-08 08:35:47,768 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-12-08 08:35:48,423 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2018-12-08 08:35:49,217 WARN L180 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2018-12-08 08:35:49,714 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2018-12-08 08:35:49,829 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-12-08 08:35:50,412 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 73 [2018-12-08 08:35:50,595 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2018-12-08 08:35:50,952 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-08 08:35:51,068 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-12-08 08:35:51,330 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-12-08 08:35:51,451 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-12-08 08:35:51,862 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2018-12-08 08:35:52,460 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2018-12-08 08:35:53,397 WARN L180 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 73 [2018-12-08 08:35:54,103 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 81 [2018-12-08 08:35:55,314 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 167 DAG size of output: 1 [2018-12-08 08:35:56,840 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 139 DAG size of output: 79 [2018-12-08 08:35:56,950 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2018-12-08 08:35:57,427 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 96 [2018-12-08 08:35:57,662 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2018-12-08 08:35:58,490 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2018-12-08 08:35:59,363 WARN L180 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 101 [2018-12-08 08:35:59,653 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-08 08:36:00,017 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70 [2018-12-08 08:36:00,415 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 56 [2018-12-08 08:36:00,735 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-12-08 08:36:01,915 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2018-12-08 08:36:02,292 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2018-12-08 08:36:02,828 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 71 [2018-12-08 08:36:03,400 WARN L180 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-12-08 08:36:03,755 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-08 08:36:04,017 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2018-12-08 08:36:04,144 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-08 08:36:05,006 WARN L180 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 64 [2018-12-08 08:36:06,660 WARN L180 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 149 DAG size of output: 83 [2018-12-08 08:36:06,772 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2018-12-08 08:36:07,053 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2018-12-08 08:36:08,317 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 203 DAG size of output: 98 [2018-12-08 08:36:09,784 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 196 DAG size of output: 89 [2018-12-08 08:36:11,662 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 142 DAG size of output: 76 [2018-12-08 08:36:11,984 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-08 08:36:12,109 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2018-12-08 08:36:12,348 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2018-12-08 08:36:12,451 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-08 08:36:12,569 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-08 08:36:12,810 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 1 [2018-12-08 08:36:13,848 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 119 DAG size of output: 79 [2018-12-08 08:36:14,114 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 80 [2018-12-08 08:36:14,609 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2018-12-08 08:36:14,849 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 72 [2018-12-08 08:36:15,514 WARN L180 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-08 08:36:15,886 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2018-12-08 08:36:16,486 WARN L180 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2018-12-08 08:36:16,681 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2018-12-08 08:36:16,861 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-08 08:36:17,300 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-12-08 08:36:17,491 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2018-12-08 08:36:17,886 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2018-12-08 08:36:18,762 WARN L180 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 62 [2018-12-08 08:36:18,978 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-12-08 08:36:19,634 WARN L180 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2018-12-08 08:36:20,422 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 73 [2018-12-08 08:36:20,527 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 1 [2018-12-08 08:36:21,473 WARN L180 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 90 [2018-12-08 08:36:21,653 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-12-08 08:36:22,175 WARN L180 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2018-12-08 08:36:24,026 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 142 DAG size of output: 79 [2018-12-08 08:36:24,145 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2018-12-08 08:36:24,331 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-12-08 08:36:24,331 INFO L444 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5))) (or (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5 .cse6) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0))) (not (= |old(~customIrp~0)| 0))))) [2018-12-08 08:36:24,331 INFO L448 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-12-08 08:36:24,331 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L444 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5 .cse6) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0))) (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) (or (= |old(~s~0)| ~s~0) (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5)))))) [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 62 83) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-12-08 08:36:24,332 INFO L444 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (= |old(~s~0)| ~s~0)) (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)))))) [2018-12-08 08:36:24,332 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-12-08 08:36:24,333 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 (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) .cse0) (or (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) .cse2) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3))))))) [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L444 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~myStatus~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-12-08 08:36:24,333 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-12-08 08:36:24,334 INFO L444 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~myStatus~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,334 INFO L444 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,334 INFO L448 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-12-08 08:36:24,334 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-12-08 08:36:24,334 INFO L444 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~myStatus~0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,334 INFO L444 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~myStatus~0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,334 INFO L444 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (or (and (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0) .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse10) .cse6 .cse7 .cse8 (<= .cse10 0) .cse9)))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,334 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-12-08 08:36:24,334 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-12-08 08:36:24,334 INFO L444 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse8 (not (= 259 main_~status~9)) .cse9 .cse2 .cse6 .cse10) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse12 .cse11 .cse4 .cse7) (not (= |old(~customIrp~0)| 0)))))) [2018-12-08 08:36:24,335 INFO L444 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,335 INFO L448 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-12-08 08:36:24,335 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-12-08 08:36:24,335 INFO L444 ceAbstractionStarter]: At program point L1846(line 1846) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,335 INFO L444 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse8 (not (= 259 main_~status~9)) .cse9 .cse2 .cse6 .cse10) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse12 .cse11 .cse4 .cse7) (not (= |old(~customIrp~0)| 0)))))) [2018-12-08 08:36:24,335 INFO L448 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-12-08 08:36:24,335 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-12-08 08:36:24,335 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-12-08 08:36:24,335 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-12-08 08:36:24,335 INFO L448 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-12-08 08:36:24,335 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-12-08 08:36:24,335 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,336 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-12-08 08:36:24,336 INFO L444 ceAbstractionStarter]: At program point L1781(lines 1780 1817) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0) .cse9) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (let ((.cse10 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse10) .cse6 .cse7 .cse8 (<= .cse10 0) .cse9)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,336 INFO L444 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (= 0 main_~status~9)) (.cse4 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (and .cse10 .cse11 .cse2)) (.cse3 (= ~IPC~0 ~s~0)) (.cse8 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse4 (not (= 259 main_~status~9)) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse5 .cse6 (<= (+ main_~status~9 1073741789) 0) .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse10 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 .cse11 .cse1 .cse2 .cse3 .cse8) (and .cse10 .cse6 .cse9 .cse11 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-12-08 08:36:24,336 INFO L448 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-12-08 08:36:24,336 INFO L444 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (and .cse13 (= 0 ~pended~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse2 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (= ~DC~0 ~s~0)) (.cse11 (and .cse4 .cse1 .cse7)) (.cse12 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (= 0 main_~status~9)) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse8 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~myStatus~0)| 0)) (and .cse4 .cse1 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse1 .cse6 .cse2 .cse7 .cse3) (and .cse10 (not (= 259 main_~status~9)) .cse11 .cse12 .cse6 .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse4 .cse13 (= ~routine~0 0) .cse5 .cse6 .cse7 .cse3 (<= 1 ~compRegistered~0) .cse8 .cse9) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse10 .cse11 .cse12 .cse6 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse3 .cse8) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))))) [2018-12-08 08:36:24,336 INFO L448 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-12-08 08:36:24,336 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-12-08 08:36:24,336 INFO L448 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-12-08 08:36:24,336 INFO L448 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-12-08 08:36:24,336 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)|)) (and (= |old(~customIrp~0)| ~customIrp~0) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 (<= .cse6 0) .cse10)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (= 0 ~myStatus~0) .cse10)))) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,336 INFO L448 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-12-08 08:36:24,336 INFO L444 ceAbstractionStarter]: At program point L1791(lines 1790 1815) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L444 ceAbstractionStarter]: At program point L1866(line 1866) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L451 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L444 ceAbstractionStarter]: At program point L1860(line 1860) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,337 INFO L444 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0) .cse3)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3))) (not (= ~customIrp~0 0))) [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0) .cse3)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3))) (not (= ~customIrp~0 0))) [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L448 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-12-08 08:36:24,337 INFO L444 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0))) [2018-12-08 08:36:24,338 INFO L444 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L444 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L444 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-12-08 08:36:24,338 INFO L444 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2018-12-08 08:36:24,338 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L444 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,339 INFO L444 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L444 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L444 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-12-08 08:36:24,339 INFO L448 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-12-08 08:36:24,340 INFO L444 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse10 (< ~MPR3~0 (+ ~NP~0 5))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse14 (not (= |old(~customIrp~0)| 0))) (.cse17 (= |old(~s~0)| ~s~0)) (.cse3 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse4 (< 0 .cse20)) (.cse5 (< .cse20 0)) (.cse16 (or .cse1 (or .cse10 .cse19 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse2 .cse11 .cse6 .cse7 (< ~IPC~0 (+ ~DC~0 5))))) (and (or (let ((.cse8 (or .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7 .cse8))) (not (= |old(~s~0)| ~MPR3~0)) .cse14) (or .cse15 (or (and (or .cse3 .cse9 .cse16) (or .cse3 .cse4 .cse5 .cse16)) .cse14)) (or .cse17 .cse3 .cse9 .cse16) (or (and .cse15 (and .cse17 (= 1 ~setEventCalled~0))) (let ((.cse18 (or .cse2 .cse11 .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse10 .cse19) .cse12 .cse7 .cse13))) (and (or .cse0 .cse3 .cse9 .cse18) (or .cse0 .cse3 .cse4 .cse5 .cse18))) .cse14) (or .cse17 .cse3 .cse4 .cse5 .cse16)))) [2018-12-08 08:36:24,340 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-12-08 08:36:24,340 INFO L448 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-12-08 08:36:24,340 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-12-08 08:36:24,340 INFO L444 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse9 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~MPR3~0 (+ ~NP~0 5))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse16 (< ~compRegistered~0 1)) (.cse17 (not (= 1 ~routine~0))) (.cse7 (not (= |old(~customIrp~0)| 0))) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (< 0 .cse20)) (.cse6 (< .cse20 0)) (.cse3 (or .cse9 (or .cse14 .cse19 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse10 .cse15 .cse11 .cse12 (< ~IPC~0 (+ ~DC~0 5)))) (.cse1 (= ~s~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (or (and (or .cse0 .cse2 .cse3) (or .cse0 .cse5 .cse6 .cse3)) .cse7)) (or (let ((.cse13 (or .cse14 .cse15 .cse16 .cse17))) (and (or .cse8 .cse9 .cse10 .cse0 .cse5 .cse6 .cse11 .cse12 .cse13) (or .cse8 .cse9 .cse10 .cse0 .cse2 .cse11 .cse12 .cse13))) (and .cse1 .cse4) (not (= |old(~s~0)| ~MPR3~0)) .cse7) (or (or (let ((.cse18 (or .cse10 .cse15 .cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse14 .cse19) .cse16 .cse12 .cse17))) (and (or .cse8 .cse0 .cse2 .cse18) (or .cse8 .cse0 .cse5 .cse6 .cse18))) .cse7) (and (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse4)) (or .cse0 .cse5 .cse6 .cse3 .cse1)))) [2018-12-08 08:36:24,340 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-12-08 08:36:24,340 INFO L444 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse9 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~MPR3~0 (+ ~NP~0 5))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse16 (< ~compRegistered~0 1)) (.cse17 (not (= 1 ~routine~0))) (.cse7 (not (= |old(~customIrp~0)| 0))) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (< 0 .cse20)) (.cse6 (< .cse20 0)) (.cse3 (or .cse9 (or .cse14 .cse19 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse10 .cse15 .cse11 .cse12 (< ~IPC~0 (+ ~DC~0 5)))) (.cse1 (= ~s~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (or (and (or .cse0 .cse2 .cse3) (or .cse0 .cse5 .cse6 .cse3)) .cse7)) (or (let ((.cse13 (or .cse14 .cse15 .cse16 .cse17))) (and (or .cse8 .cse9 .cse10 .cse0 .cse5 .cse6 .cse11 .cse12 .cse13) (or .cse8 .cse9 .cse10 .cse0 .cse2 .cse11 .cse12 .cse13))) (and .cse1 .cse4) (not (= |old(~s~0)| ~MPR3~0)) .cse7) (or (or (let ((.cse18 (or .cse10 .cse15 .cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse14 .cse19) .cse16 .cse12 .cse17))) (and (or .cse8 .cse0 .cse2 .cse18) (or .cse8 .cse0 .cse5 .cse6 .cse18))) .cse7) (and (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse4)) (or .cse0 .cse5 .cse6 .cse3 .cse1)))) [2018-12-08 08:36:24,340 INFO L444 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= 0 ~pended~0))) (.cse8 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse1 (not (= ~myStatus~0 0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (< ~compRegistered~0 1)) (.cse14 (not (= 1 ~routine~0))) (.cse15 (not (= |old(~customIrp~0)| 0))) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (< 0 .cse18)) (.cse7 (< .cse18 0)) (.cse2 (or .cse4 (or .cse11 .cse17 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse12 .cse8 .cse9 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse0 .cse1 .cse2) (or (let ((.cse10 (or .cse11 .cse12 .cse13 .cse14))) (and (or .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse4 .cse5 .cse0 .cse1 .cse8 .cse9 .cse10))) (not (= |old(~s~0)| ~MPR3~0)) .cse15) (or (let ((.cse16 (or .cse5 .cse12 .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse11 .cse17) .cse13 .cse9 .cse14))) (and (or .cse3 .cse0 .cse1 .cse16) (or .cse3 .cse0 .cse6 .cse7 .cse16))) .cse15) (or .cse0 .cse6 .cse7 .cse2)))) [2018-12-08 08:36:24,340 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-12-08 08:36:24,340 INFO L448 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-12-08 08:36:24,341 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-12-08 08:36:24,341 INFO L448 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-12-08 08:36:24,341 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-12-08 08:36:24,341 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637)) (.cse19 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse8 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse16 (= |old(~s~0)| ~s~0)) (.cse18 (or .cse19 (or .cse9 .cse10 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse7 .cse8 .cse12 (< ~IPC~0 (+ ~DC~0 5)))) (.cse17 (= 1 ~setEventCalled~0)) (.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (< 0 .cse21)) (.cse5 (< .cse21 0)) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse2 (not (= ~myStatus~0 0))) (.cse11 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse14 (not (= |old(~customIrp~0)| 0)))) (and (or (or (let ((.cse3 (or .cse6 .cse7 .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse9 .cse10) .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse3))) .cse14) (and .cse15 (and .cse16 .cse17))) (or (or (and (or .cse1 .cse2 .cse18) (or .cse1 .cse4 .cse5 .cse18)) .cse14) .cse15) (or .cse1 .cse4 .cse5 .cse16 .cse18) (or .cse16 .cse1 .cse2 .cse18) (or (and (= ~s~0 ~MPR3~0) .cse17 .cse15) (or (let ((.cse20 (or .cse9 .cse7 .cse11 .cse13))) (and (or .cse0 .cse19 .cse6 .cse1 .cse4 .cse5 .cse8 .cse12 .cse20) (or .cse0 .cse19 .cse6 .cse1 .cse2 .cse8 .cse12 .cse20))) (not (= |old(~s~0)| ~MPR3~0)) .cse14))))) [2018-12-08 08:36:24,341 INFO L444 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-12-08 08:36:24,341 INFO L448 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-12-08 08:36:24,341 INFO L444 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-08 08:36:24,341 INFO L448 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-12-08 08:36:24,341 INFO L444 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,341 INFO L444 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-12-08 08:36:24,341 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-12-08 08:36:24,341 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L444 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (= |old(~s~0)| ~s~0)) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse5) (< ~IPC~0 (+ ~SKIP2~0 3))) .cse6) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L444 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~DC~0 5)) (or .cse5 (not (= ~compRegistered~0 0)))) (or (or (or (or .cse1 .cse5) .cse0 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse4) (< ~IPC~0 (+ ~SKIP2~0 3))))) [2018-12-08 08:36:24,342 INFO L444 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L444 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,342 INFO L444 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-12-08 08:36:24,342 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~pended~0)) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse11) .cse3 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L444 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< 0 .cse0) (< ~SKIP1~0 (+ ~s~0 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (< .cse0 0) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1))) [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L444 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ ~s~0 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse1 0) .cse8 .cse9 .cse10)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-12-08 08:36:24,343 INFO L448 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-12-08 08:36:24,348 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-12-08 08:36:24,348 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-12-08 08:36:24,348 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-12-08 08:36:24,348 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-12-08 08:36:24,348 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-12-08 08:36:24,349 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,349 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-12-08 08:36:24,349 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-12-08 08:36:24,349 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-12-08 08:36:24,349 INFO L448 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-12-08 08:36:24,349 INFO L444 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (and (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,349 INFO L448 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L448 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,356 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-12-08 08:36:24,356 INFO L444 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,357 INFO L444 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,357 INFO L444 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0))) [2018-12-08 08:36:24,359 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-12-08 08:36:24,359 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-12-08 08:36:24,359 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-08 08:36:24,359 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-12-08 08:36:24,359 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |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-12-08 08:36:24,359 INFO L448 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-12-08 08:36:24,359 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-12-08 08:36:24,359 INFO L444 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (<= (+ ~myStatus~0 1073741637) 0) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,360 INFO L444 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0))) [2018-12-08 08:36:24,364 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) (and (and (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= 1 ~setEventCalled~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-12-08 08:36:24,364 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-12-08 08:36:24,364 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-12-08 08:36:24,364 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-12-08 08:36:24,364 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-12-08 08:36:24,364 INFO L448 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-12-08 08:36:24,364 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-12-08 08:36:24,364 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-12-08 08:36:24,364 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-12-08 08:36:24,364 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-12-08 08:36:24,364 INFO L451 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-12-08 08:36:24,365 INFO L448 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-12-08 08:36:24,368 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L444 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L444 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse3 (< ~SKIP2~0 .cse14)) (.cse4 (and (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (<= .cse13 ~MPR3~0) (= |old(~s~0)| ~s~0)) (<= .cse14 ~SKIP2~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-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L444 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L448 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-12-08 08:36:24,369 INFO L444 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,372 INFO L444 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~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-12-08 08:36:24,372 INFO L448 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-12-08 08:36:24,372 INFO L448 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-12-08 08:36:24,372 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-12-08 08:36:24,373 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-12-08 08:36:24,373 INFO L444 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,373 INFO L444 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (let ((.cse12 (+ ~SKIP2~0 3)) (.cse16 (+ ~SKIP1~0 2)) (.cse13 (+ ~DC~0 2)) (.cse15 (+ ~NP~0 5)) (.cse14 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse14)) (.cse1 (< ~MPR3~0 .cse15)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse16)) (.cse6 (< ~IPC~0 .cse12)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (and (<= .cse12 ~IPC~0) (and (<= .cse13 ~SKIP2~0) (and (<= .cse14 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse15 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse16 ~MPR1~0))) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 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 (< .cse11 0) .cse7 .cse8 .cse9 .cse10))))) [2018-12-08 08:36:24,377 INFO L444 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,377 INFO L448 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-12-08 08:36:24,377 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-12-08 08:36:24,377 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-12-08 08:36:24,377 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-12-08 08:36:24,377 INFO L444 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.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-12-08 08:36:24,377 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-12-08 08:36:24,377 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-12-08 08:36:24,377 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-12-08 08:36:24,378 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-12-08 08:36:24,378 INFO L444 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse15 (+ ~NP~0 5)) (.cse14 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse14)) (.cse1 (< ~MPR3~0 .cse15)) (.cse3 (< ~SKIP2~0 .cse13)) (.cse4 (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse12) (and (<= .cse13 ~SKIP2~0) (and (<= .cse14 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse15 ~MPR3~0))) (<= .cse12 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-12-08 08:36:24,387 INFO L448 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-12-08 08:36:24,387 INFO L444 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,387 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-12-08 08:36:24,387 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-12-08 08:36:24,387 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-12-08 08:36:24,387 INFO L444 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,387 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-12-08 08:36:24,388 INFO L444 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (let ((.cse17 (+ ~SKIP2~0 3)) (.cse16 (+ ~SKIP1~0 2)) (.cse13 (+ ~DC~0 2)) (.cse15 (+ ~NP~0 5)) (.cse14 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse14)) (.cse1 (< ~MPR3~0 .cse15)) (.cse3 (< ~SKIP2~0 .cse13)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse16)) (.cse7 (< ~IPC~0 .cse17)) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse12) (and (<= .cse13 ~SKIP2~0) (and (<= .cse14 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse15 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse16 ~MPR1~0))) (<= .cse17 ~IPC~0) (<= .cse12 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 (< .cse2 0) .cse8 .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-08 08:36:24,398 INFO L448 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-12-08 08:36:24,399 INFO L448 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-12-08 08:36:24,399 INFO L444 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,399 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-12-08 08:36:24,399 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-12-08 08:36:24,399 INFO L448 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-12-08 08:36:24,399 INFO L444 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (let ((.cse14 (+ ~NP~0 5)) (.cse13 (+ ~NP~0 2))) (let ((.cse1 (< ~SKIP1~0 .cse13)) (.cse2 (< ~MPR3~0 .cse14)) (.cse0 (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse12) (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse14 ~MPR3~0)) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse12 0)))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-08 08:36:24,399 INFO L444 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (and (and (<= .cse12 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse13 ~MPR3~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L444 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-12-08 08:36:24,411 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-12-08 08:36:24,412 INFO L444 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (let ((.cse17 (+ ~MPR3~0 1)) (.cse13 (+ ~SKIP1~0 2)) (.cse16 (+ ~DC~0 2)) (.cse15 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse15)) (.cse3 (< ~SKIP2~0 .cse16)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse13)) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse17)) (.cse11 (let ((.cse14 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= .cse12 ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (<= .cse13 ~MPR1~0) (<= 0 .cse14) (= ~routine~0 0) (<= .cse15 ~MPR3~0) (<= .cse16 ~SKIP2~0) (<= .cse14 0) (<= .cse17 ~IPC~0))))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-08 08:36:24,417 INFO L448 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-12-08 08:36:24,417 INFO L444 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse3 (< ~SKIP2~0 .cse14)) (.cse4 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~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-12-08 08:36:24,417 INFO L448 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-12-08 08:36:24,417 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-12-08 08:36:24,417 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-12-08 08:36:24,417 INFO L444 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.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-12-08 08:36:24,417 INFO L448 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-12-08 08:36:24,417 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-12-08 08:36:24,417 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-12-08 08:36:24,418 INFO L444 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse13 ~MPR3~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.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-12-08 08:36:24,420 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-12-08 08:36:24,420 INFO L444 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse3 (and (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (<= .cse13 ~MPR3~0) (= |old(~s~0)| ~s~0)) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse3 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-08 08:36:24,420 INFO L448 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-12-08 08:36:24,420 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-12-08 08:36:24,420 INFO L444 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.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-12-08 08:36:24,420 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-12-08 08:36:24,420 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-12-08 08:36:24,420 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-12-08 08:36:24,420 INFO L444 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (let ((.cse14 (+ ~NP~0 5)) (.cse13 (+ ~NP~0 2))) (let ((.cse1 (< ~SKIP1~0 .cse13)) (.cse2 (< ~MPR3~0 .cse14)) (.cse0 (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse12) (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse14 ~MPR3~0)) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse12 0)))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-08 08:36:24,424 INFO L448 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-12-08 08:36:24,424 INFO L448 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-12-08 08:36:24,425 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-12-08 08:36:24,425 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-12-08 08:36:24,425 INFO L448 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-12-08 08:36:24,425 INFO L444 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-08 08:36:24,425 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-12-08 08:36:24,425 INFO L448 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-12-08 08:36:24,425 INFO L444 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse23 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2)) (.cse18 (+ ~MPR3~0 1))) (let ((.cse4 (not (= 0 ~routine~0))) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse18 ~IPC~0))) (.cse13 (= 0 ~pended~0)) (.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse7 (< ~IPC~0 .cse22)) (.cse14 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse18)) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse13 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse13 (<= 0 .cse15) (= ~MPR1~0 ~s~0) (<= .cse16 0) (= 1 ~setEventCalled~0) (<= 0 .cse16))) (let ((.cse17 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse1 .cse8 .cse17) (or .cse7 .cse14 .cse17))) (not (= ~customIrp~0 0)))))) [2018-12-08 08:36:24,430 INFO L444 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse23 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2)) (.cse18 (+ ~MPR3~0 1))) (let ((.cse4 (not (= 0 ~routine~0))) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse18 ~IPC~0))) (.cse13 (= 0 ~pended~0)) (.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse7 (< ~IPC~0 .cse22)) (.cse14 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse18)) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse13 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse13 (<= 0 .cse15) (= ~MPR1~0 ~s~0) (<= .cse16 0) (= 1 ~setEventCalled~0) (<= 0 .cse16))) (let ((.cse17 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse1 .cse8 .cse17) (or .cse7 .cse14 .cse17))) (not (= ~customIrp~0 0)))))) [2018-12-08 08:36:24,430 INFO L448 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-12-08 08:36:24,430 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-12-08 08:36:24,430 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-12-08 08:36:24,430 INFO L448 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-12-08 08:36:24,430 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-12-08 08:36:24,430 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637)) (.cse13 (= 0 ~pended~0))) (let ((.cse2 (and .cse13 (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse1 (< 0 .cse16)) (.cse9 (< .cse16 0)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse14 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.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 (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse4 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11 (and .cse13 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse14 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (or (and .cse13 (= ~s~0 |old(~s~0)|)) (let ((.cse15 (or .cse0 .cse3 .cse4 (not (= 1 ~routine~0)) .cse6 .cse7 .cse10 .cse11 .cse12))) (and (or .cse8 .cse1 .cse9 .cse15) (or .cse8 .cse14 .cse15))) (not (= ~customIrp~0 0)))))) [2018-12-08 08:36:24,438 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-12-08 08:36:24,438 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-12-08 08:36:24,438 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-12-08 08:36:24,438 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-12-08 08:36:24,439 INFO L444 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse23 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2)) (.cse18 (+ ~MPR3~0 1))) (let ((.cse4 (not (= 0 ~routine~0))) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse18 ~IPC~0))) (.cse13 (= 0 ~pended~0)) (.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse7 (< ~IPC~0 .cse22)) (.cse14 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse18)) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse13 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse13 (<= 0 .cse15) (= ~MPR1~0 ~s~0) (<= .cse16 0) (= 1 ~setEventCalled~0) (<= 0 .cse16))) (let ((.cse17 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse1 .cse8 .cse17) (or .cse7 .cse14 .cse17))) (not (= ~customIrp~0 0)))))) [2018-12-08 08:36:24,439 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-12-08 08:36:24,439 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-12-08 08:36:24,439 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-12-08 08:36:24,439 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-12-08 08:36:24,439 INFO L444 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse14)) (.cse10 (< .cse14 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= ~myStatus~0 0))) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or (let ((.cse12 (or .cse0 .cse8 .cse1 (not (= 1 ~routine~0)) .cse9 .cse3 .cse5 .cse6 .cse11))) (and (or .cse4 .cse7 .cse10 .cse12) (or .cse4 .cse13 .cse12))) (not (= ~customIrp~0 0))) (or .cse0 .cse13 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11)))) [2018-12-08 08:36:24,451 INFO L448 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-12-08 08:36:24,451 INFO L444 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse15 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse15)) (.cse9 (< .cse15 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse14 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse4 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (let ((.cse13 (or .cse0 .cse3 .cse4 (not (= 1 ~routine~0)) .cse6 .cse7 .cse10 .cse11 .cse12))) (and (or .cse8 .cse1 .cse9 .cse13) (or .cse8 .cse14 .cse13))) (not (= ~customIrp~0 0))) (or .cse0 .cse14 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2018-12-08 08:36:24,451 INFO L448 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-12-08 08:36:24,451 INFO L444 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse23 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2)) (.cse18 (+ ~MPR3~0 1))) (let ((.cse4 (not (= 0 ~routine~0))) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse18 ~IPC~0))) (.cse13 (= 0 ~pended~0)) (.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse7 (< ~IPC~0 .cse22)) (.cse14 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse18)) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse13 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse13 (<= 0 .cse15) (= ~MPR1~0 ~s~0) (<= .cse16 0) (= 1 ~setEventCalled~0) (<= 0 .cse16))) (let ((.cse17 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse1 .cse8 .cse17) (or .cse7 .cse14 .cse17))) (not (= ~customIrp~0 0)))))) [2018-12-08 08:36:24,461 INFO L444 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= 0 ~routine~0))) (.cse7 (< 0 .cse16)) (.cse10 (< .cse16 0)) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or .cse0 .cse12 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11) (or (and (let ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse14 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) (= 0 ~pended~0) (<= 0 .cse13) (<= .cse14 0) (= 1 ~setEventCalled~0) (<= 0 .cse14))) (= ~s~0 |old(~s~0)|)) (or (let ((.cse15 (or .cse0 .cse8 .cse1 (not (= 1 ~routine~0)) .cse9 .cse3 .cse5 .cse6 .cse11))) (and (or .cse4 .cse7 .cse10 .cse15) (or .cse4 .cse12 .cse15))) (not (= ~customIrp~0 0))))))) [2018-12-08 08:36:24,461 INFO L444 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= 0 ~routine~0))) (.cse7 (< 0 .cse14)) (.cse10 (< .cse14 0)) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or .cse0 .cse12 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11) (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (let ((.cse13 (or .cse0 .cse8 .cse1 (not (= 1 ~routine~0)) .cse9 .cse3 .cse5 .cse6 .cse11))) (and (or .cse4 .cse7 .cse10 .cse13) (or .cse4 .cse12 .cse13))) (not (= ~customIrp~0 0)))))) [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L444 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-12-08 08:36:24,470 INFO L444 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L444 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 08:36:24,470 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) [2018-12-08 08:36:24,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 08:36:24,471 INFO L444 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L444 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L444 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L444 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L444 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-12-08 08:36:24,478 INFO L444 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |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-12-08 08:36:24,487 INFO L444 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (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) .cse4 .cse2 .cse3 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-08 08:36:24,487 INFO L448 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-12-08 08:36:24,487 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-12-08 08:36:24,487 INFO L448 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-12-08 08:36:24,487 INFO L448 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-12-08 08:36:24,487 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-12-08 08:36:24,487 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-12-08 08:36:24,487 INFO L444 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse29 (+ ~NP~0 5))) (let ((.cse27 (+ ~MPR3~0 1)) (.cse28 (+ ~SKIP1~0 2)) (.cse30 (+ ~NP~0 2)) (.cse26 (<= .cse29 ~MPR3~0)) (.cse25 (+ ~DC~0 2)) (.cse24 (+ ~SKIP2~0 3))) (let ((.cse19 (<= .cse24 ~IPC~0)) (.cse20 (<= .cse25 ~SKIP2~0)) (.cse15 (and (= 0 ~pended~0) .cse26)) (.cse16 (<= .cse30 ~SKIP1~0)) (.cse22 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse18 (<= .cse28 ~MPR1~0)) (.cse23 (= ~IPC~0 ~s~0)) (.cse17 (= ~routine~0 0)) (.cse21 (<= .cse27 ~IPC~0))) (let ((.cse0 (< ~SKIP1~0 .cse30)) (.cse1 (< ~MPR3~0 .cse29)) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (< ~MPR1~0 .cse28)) (.cse5 (not (= |old(~compRegistered~0)| 0))) (.cse6 (< ~IPC~0 .cse27)) (.cse7 (and .cse16 .cse22 .cse18 (<= 1 ~compRegistered~0) .cse23 .cse17 .cse26 .cse21)) (.cse8 (< ~SKIP2~0 .cse25)) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~IPC~0 .cse24)) (.cse11 (and (not (= 259 CdAudioDeviceControl_~status~3)) (= ~DC~0 ~s~0) .cse20 (and .cse15 .cse16 .cse17 .cse18) .cse21)) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse14 (and .cse15 .cse16 .cse22 .cse17 .cse19 .cse20 .cse18 (= ~NP~0 |old(~s~0)|) .cse23 .cse21)) (.cse13 (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse15 .cse16 .cse17 (= ~SKIP2~0 ~s~0) .cse18) .cse19 .cse20 (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3) .cse21))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse2 0) .cse11 .cse12 .cse13 .cse14)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13)))))) [2018-12-08 08:36:24,497 INFO L444 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |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-12-08 08:36:24,497 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-12-08 08:36:24,497 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-12-08 08:36:24,497 INFO L444 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (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-12-08 08:36:24,497 INFO L448 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-12-08 08:36:24,497 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-12-08 08:36:24,502 INFO L444 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-08 08:36:24,502 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-08 08:36:24,502 INFO L444 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |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-12-08 08:36:24,502 INFO L444 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-08 08:36:24,502 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-12-08 08:36:24,502 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-12-08 08:36:24,502 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 08:36:24,502 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0)) [2018-12-08 08:36:24,502 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 08:36:24,502 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 08:36:24,502 INFO L444 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,509 INFO L448 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-12-08 08:36:24,509 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,509 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-12-08 08:36:24,509 INFO L444 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670)) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp106~1 4294967296) 1) 0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,509 INFO L448 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-12-08 08:36:24,510 INFO L448 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-12-08 08:36:24,510 INFO L444 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-08 08:36:24,510 INFO L448 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-12-08 08:36:24,510 INFO L448 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-12-08 08:36:24,510 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-12-08 08:36:24,510 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-12-08 08:36:24,510 INFO L444 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse0 0) (<= 0 .cse0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp109~1 4294967296) 1) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))))) [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L444 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L444 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L444 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L448 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-12-08 08:36:24,516 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0)) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-12-08 08:36:24,522 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-12-08 08:36:24,522 INFO L448 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-12-08 08:36:24,522 INFO L444 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,522 INFO L448 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-12-08 08:36:24,522 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-12-08 08:36:24,523 INFO L444 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,523 INFO L444 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,523 INFO L444 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0))) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-12-08 08:36:24,523 INFO L448 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-12-08 08:36:24,523 INFO L448 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-12-08 08:36:24,523 INFO L444 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-08 08:36:24,533 INFO L444 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-12-08 08:36:24,533 INFO L444 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-08 08:36:24,533 INFO L444 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-12-08 08:36:24,533 INFO L444 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,533 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L444 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L444 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L444 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-12-08 08:36:24,539 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-12-08 08:36:24,540 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-12-08 08:36:24,540 INFO L444 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,545 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-12-08 08:36:24,545 INFO L444 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-08 08:36:24,545 INFO L448 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-12-08 08:36:24,545 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-12-08 08:36:24,545 INFO L444 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,545 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-12-08 08:36:24,545 INFO L448 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-12-08 08:36:24,545 INFO L444 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-08 08:36:24,545 INFO L448 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-12-08 08:36:24,545 INFO L444 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,545 INFO L448 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-12-08 08:36:24,545 INFO L444 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,551 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L444 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L448 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-12-08 08:36:24,552 INFO L444 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L444 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L444 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-12-08 08:36:24,557 INFO L448 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-12-08 08:36:24,558 INFO L444 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6))) [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L444 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L444 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-12-08 08:36:24,565 INFO L451 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-12-08 08:36:24,566 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-12-08 08:36:24,569 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-12-08 08:36:24,569 INFO L448 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-12-08 08:36:24,569 INFO L448 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-12-08 08:36:24,569 INFO L448 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-12-08 08:36:24,569 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)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))) (or .cse0 .cse1 (not (= ~myStatus~0 0))))) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,569 INFO L448 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-12-08 08:36:24,569 INFO L448 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-12-08 08:36:24,570 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-12-08 08:36:24,570 INFO L444 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))) (or .cse0 .cse1 (not (= ~myStatus~0 0))))) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,570 INFO L448 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-12-08 08:36:24,570 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)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))) (or .cse0 .cse1 (not (= ~myStatus~0 0))))) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 08:36:24,570 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)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))) (or .cse0 .cse1 (not (= ~myStatus~0 0))))) (not (= |old(~customIrp~0)| 0))) [2018-12-08 08:36:24,570 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-12-08 08:36:24,572 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-12-08 08:36:24,572 INFO L444 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= 1 ~compRegistered~0)) (.cse4 (= 1 ~setEventCalled~0)) (.cse3 (= ~routine~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) (= ~s~0 ~MPR3~0) .cse5) (and .cse5 (and .cse0 .cse1 (= |old(~s~0)| ~s~0) .cse2 .cse4 .cse3)) (or (let ((.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (let ((.cse8 (+ ~myStatus~0 1073741637))) (or .cse6 .cse7 (< 0 .cse8) (< .cse8 0))) (or .cse6 .cse7 (not (= ~myStatus~0 0))))) (not (= |old(~customIrp~0)| 0))))) [2018-12-08 08:36:24,572 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-12-08 08:36:24,572 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-12-08 08:36:24,572 INFO L451 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-12-08 08:36:24,572 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-12-08 08:36:24,572 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-12-08 08:36:24,572 INFO L448 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-12-08 08:36:24,573 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-12-08 08:36:24,573 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-12-08 08:36:24,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:36:24 BoogieIcfgContainer [2018-12-08 08:36:24,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 08:36:24,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:36:24,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:36:24,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:36:24,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:35:03" (3/4) ... [2018-12-08 08:36:24,618 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-08 08:36:24,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-12-08 08:36:24,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-12-08 08:36:24,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-08 08:36:24,639 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-12-08 08:36:24,640 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-12-08 08:36:24,641 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 08:36:24,663 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 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,663 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-12-08 08:36:24,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) [2018-12-08 08:36:24,664 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((IPC < SKIP2 + 3 || s == NP) || !(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) && (\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) && (((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)) || !(\old(customIrp) == 0))) && ((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && ((((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\old(customIrp) == 0)) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((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) || s == NP) [2018-12-08 08:36:24,664 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((IPC < SKIP2 + 3 || s == NP) || !(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) && (\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) && (((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)) || !(\old(customIrp) == 0))) && ((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && ((((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\old(customIrp) == 0)) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((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) || s == NP) [2018-12-08 08:36:24,664 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) [2018-12-08 08:36:24,664 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,664 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) [2018-12-08 08:36:24,664 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) [2018-12-08 08:36:24,665 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,665 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || SKIP2 < DC + 2) || !(\old(s) == NP)) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || ((((!(259 == status) && DC == s) && DC + 2 <= SKIP2) && (((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || !(0 == \old(pended))) || (((((status <= lowerDriverReturn && ((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= status) && MPR3 + 1 <= IPC)) || ((((((((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && IPC == s) && MPR3 + 1 <= IPC)) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || SKIP2 < DC + 2) || !(\old(s) == NP)) || IPC < SKIP2 + 3) || ((((!(259 == status) && DC == s) && DC + 2 <= SKIP2) && (((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || !(0 == \old(pended))) || ((((((((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && IPC == s) && MPR3 + 1 <= IPC)) || (((((status <= lowerDriverReturn && ((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= status) && MPR3 + 1 <= IPC)) [2018-12-08 08:36:24,669 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || !(\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) && (((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)) || !(\old(customIrp) == 0))) && (((\old(s) == s || 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)) && (((\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled) || ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(\old(customIrp) == 0))) && ((((\old(s) == s || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-08 08:36:24,683 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-12-08 08:36:24,683 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-12-08 08:36:24,683 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,699 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) [2018-12-08 08:36:24,700 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) [2018-12-08 08:36:24,717 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(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) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,717 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((((s == NP && 0 == pended) && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) [2018-12-08 08:36:24,717 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || !(\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) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,731 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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-12-08 08:36:24,731 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,731 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || !(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) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,731 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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-12-08 08:36:24,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == myStatus && ((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,745 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || ((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2 && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || ((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2 && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,745 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) [2018-12-08 08:36:24,745 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,761 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == myStatus && ((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,762 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= status + 1073741670 && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || (((0 <= status + 1073741670 && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && myStatus == \old(myStatus)) && status + 1073741670 <= 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,764 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 0 == compRegistered) && routine == 0) && s == \old(s)) && \old(myStatus) == myStatus) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,764 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && routine == 0) && s == \old(s)) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-12-08 08:36:24,781 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-12-08 08:36:24,783 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-08 08:36:24,783 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) || ((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) [2018-12-08 08:36:24,783 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-08 08:36:24,783 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,783 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-08 08:36:24,797 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,797 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-08 08:36:24,797 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,797 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-08 08:36:24,797 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,798 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-08 08:36:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && \old(s) == s) [2018-12-08 08:36:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-08 08:36:24,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-08 08:36:24,839 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) [2018-12-08 08:36:24,927 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bbb0bd17-4548-4961-8130-f98403aa72a0/bin-2019/uautomizer/witness.graphml [2018-12-08 08:36:24,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:36:24,928 INFO L168 Benchmark]: Toolchain (without parser) took 82825.39 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 880.8 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 721.9 MB. Max. memory is 11.5 GB. [2018-12-08 08:36:24,929 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:36:24,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:36:24,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.76 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-08 08:36:24,930 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 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-12-08 08:36:24,930 INFO L168 Benchmark]: RCFGBuilder took 694.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.7 MB in the end (delta: 144.7 MB). Peak memory consumption was 144.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:36:24,930 INFO L168 Benchmark]: TraceAbstraction took 81358.54 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 737.1 MB). Free memory was 974.7 MB in the beginning and 1.2 GB in the end (delta: -202.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-08 08:36:24,930 INFO L168 Benchmark]: Witness Printer took 312.30 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:36:24,932 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.76 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.93 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. * RCFGBuilder took 694.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.7 MB in the end (delta: 144.7 MB). Peak memory consumption was 144.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81358.54 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 737.1 MB). Free memory was 974.7 MB in the beginning and 1.2 GB in the end (delta: -202.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 312.30 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1756]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || ((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2 && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || ((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2 && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 2074]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || (((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: ((((((IPC < SKIP2 + 3 || s == NP) || !(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) && (\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) && (((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)) || !(\old(customIrp) == 0))) && ((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && ((((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\old(customIrp) == 0)) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((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) || s == NP) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == myStatus && ((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: ((((((IPC < SKIP2 + 3 || s == NP) || !(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) && (\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) && (((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)) || !(\old(customIrp) == 0))) && ((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && ((((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\old(customIrp) == 0)) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((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) || s == NP) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == myStatus && ((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || !(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) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && \old(s) == s) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || !(\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) && (((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)) || !(\old(customIrp) == 0))) && (((\old(s) == s || 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)) && (((\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled) || ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(\old(customIrp) == 0))) && ((((\old(s) == s || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) - 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 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1))) || !(customIrp == 0)) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || SKIP2 < DC + 2) || !(\old(s) == NP)) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || ((((!(259 == status) && DC == s) && DC + 2 <= SKIP2) && (((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || !(0 == \old(pended))) || (((((status <= lowerDriverReturn && ((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= status) && MPR3 + 1 <= IPC)) || ((((((((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && IPC == s) && MPR3 + 1 <= IPC)) && ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || SKIP2 < DC + 2) || !(\old(s) == NP)) || IPC < SKIP2 + 3) || ((((!(259 == status) && DC == s) && DC + 2 <= SKIP2) && (((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || !(0 == \old(pended))) || ((((((((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && IPC == s) && MPR3 + 1 <= IPC)) || (((((status <= lowerDriverReturn && ((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && routine == 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= status) && MPR3 + 1 <= IPC)) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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) && s == \old(s)) && \old(myStatus) == myStatus) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) || ((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) - InvariantResult [Line: 2079]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= status + 1073741670 && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || (((0 <= status + 1073741670 && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && myStatus == \old(myStatus)) && status + 1073741670 <= 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || !(\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) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((((s == NP && 0 == pended) && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && routine == 0) && s == \old(s)) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(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) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus))) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((0 == pended && \old(s) == s) || SKIP1 < NP + 2) || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && \old(s) == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(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, 81.2s OverallTime, 96 OverallIterations, 2 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 56.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 50315 SDtfs, 19531 SDslu, 223461 SDs, 0 SdLazy, 22347 SolverSat, 3294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 332 SyntacticMatches, 8 SemanticMatches, 750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=944occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 96 MinimizatonAttempts, 2976 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1829 PreInvPairs, 2239 NumberOfFragments, 23352 HoareAnnotationTreeSize, 1829 FomulaSimplifications, 58853134 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 171 FomulaSimplificationsInter, 1680326 FormulaSimplificationTreeSizeReductionInter, 54.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 6443 NumberOfCodeBlocks, 6443 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 6346 ConstructedInterpolants, 0 QuantifiedInterpolants, 897374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 927 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 97 InterpolantComputations, 95 PerfectInterpolantSequences, 65/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...