./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_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_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/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 c23505adeafc05501dae695d01ba5b7f16426196 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 15:03:14,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:03:14,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:03:14,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:03:14,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:03:14,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:03:14,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:03:14,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:03:14,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:03:14,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:03:14,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:03:14,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:03:14,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:03:14,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:03:14,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:03:14,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:03:14,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:03:14,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:03:14,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:03:14,608 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:03:14,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:03:14,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:03:14,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:03:14,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:03:14,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:03:14,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:03:14,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:03:14,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:03:14,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:03:14,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:03:14,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:03:14,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:03:14,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:03:14,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:03:14,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:03:14,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:03:14,613 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 15:03:14,620 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:03:14,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:03:14,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 15:03:14,621 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 15:03:14,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:03:14,621 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:03:14,621 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:03:14,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:03:14,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:03:14,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:03:14,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 15:03:14,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:03:14,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 15:03:14,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 15:03:14,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 15:03:14,623 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_11905f50-d789-44a7-956e-b03ce301d392/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 -> c23505adeafc05501dae695d01ba5b7f16426196 [2018-12-01 15:03:14,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:03:14,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:03:14,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:03:14,651 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:03:14,651 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:03:14,652 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-01 15:03:14,688 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/data/93c7a7c41/b3fae617441642cea4af9516e9668fd9/FLAG655bfb303 [2018-12-01 15:03:15,018 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:03:15,018 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-01 15:03:15,024 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/data/93c7a7c41/b3fae617441642cea4af9516e9668fd9/FLAG655bfb303 [2018-12-01 15:03:15,032 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/data/93c7a7c41/b3fae617441642cea4af9516e9668fd9 [2018-12-01 15:03:15,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:03:15,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 15:03:15,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:03:15,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:03:15,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:03:15,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650b367b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15, skipping insertion in model container [2018-12-01 15:03:15,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:03:15,065 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:03:15,205 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:03:15,208 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:03:15,280 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:03:15,291 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:03:15,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15 WrapperNode [2018-12-01 15:03:15,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:03:15,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 15:03:15,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 15:03:15,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 15:03:15,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 15:03:15,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:03:15,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:03:15,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:03:15,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... [2018-12-01 15:03:15,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:03:15,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:03:15,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:03:15,345 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:03:15,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/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-01 15:03:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-12-01 15:03:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-12-01 15:03:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-01 15:03:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-01 15:03:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-12-01 15:03:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-12-01 15:03:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-12-01 15:03:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-12-01 15:03:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 15:03:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-01 15:03:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-12-01 15:03:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-01 15:03:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-01 15:03:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-12-01 15:03:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-12-01 15:03:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-12-01 15:03:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-12-01 15:03:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-01 15:03:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-01 15:03:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-01 15:03:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-01 15:03:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-01 15:03:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-12-01 15:03:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 15:03:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-12-01 15:03:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-12-01 15:03:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-12-01 15:03:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-12-01 15:03:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:03:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:03:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-12-01 15:03:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-12-01 15:03:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-12-01 15:03:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-12-01 15:03:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-01 15:03:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-01 15:03:15,480 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,480 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,517 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,517 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,528 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,528 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,625 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,625 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,669 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,669 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,722 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,722 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,733 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,733 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,739 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,739 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,748 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,748 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,793 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,793 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,798 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,798 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,802 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:03:15,802 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:03:15,818 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:03:15,819 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 15:03:15,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:03:15 BoogieIcfgContainer [2018-12-01 15:03:15,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:03:15,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 15:03:15,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 15:03:15,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 15:03:15,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:03:15" (1/3) ... [2018-12-01 15:03:15,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725d6c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:03:15, skipping insertion in model container [2018-12-01 15:03:15,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:03:15" (2/3) ... [2018-12-01 15:03:15,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725d6c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:03:15, skipping insertion in model container [2018-12-01 15:03:15,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:03:15" (3/3) ... [2018-12-01 15:03:15,825 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-01 15:03:15,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 15:03:15,840 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 15:03:15,853 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 15:03:15,878 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:03:15,879 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 15:03:15,879 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 15:03:15,879 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 15:03:15,879 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:03:15,879 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:03:15,879 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 15:03:15,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:03:15,879 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 15:03:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states. [2018-12-01 15:03:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 15:03:15,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:15,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:15,900 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:15,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash -309041171, now seen corresponding path program 1 times [2018-12-01 15:03:15,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:15,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:15,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:15,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:15,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:16,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-01 15:03:16,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:16,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:16,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:16,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:16,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,038 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 3 states. [2018-12-01 15:03:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:16,093 INFO L93 Difference]: Finished difference Result 508 states and 727 transitions. [2018-12-01 15:03:16,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:16,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-01 15:03:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:16,103 INFO L225 Difference]: With dead ends: 508 [2018-12-01 15:03:16,103 INFO L226 Difference]: Without dead ends: 292 [2018-12-01 15:03:16,106 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-01 15:03:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-01 15:03:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-12-01 15:03:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-01 15:03:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2018-12-01 15:03:16,145 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2018-12-01 15:03:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:16,145 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2018-12-01 15:03:16,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2018-12-01 15:03:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 15:03:16,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03: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] [2018-12-01 15:03:16,146 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:16,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash -940725380, now seen corresponding path program 1 times [2018-12-01 15:03:16,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:16,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:16,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:16,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:16,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:16,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,241 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 3 states. [2018-12-01 15:03:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:16,335 INFO L93 Difference]: Finished difference Result 601 states and 800 transitions. [2018-12-01 15:03:16,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:16,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 15:03:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:16,338 INFO L225 Difference]: With dead ends: 601 [2018-12-01 15:03:16,338 INFO L226 Difference]: Without dead ends: 440 [2018-12-01 15:03:16,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-12-01 15:03:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 423. [2018-12-01 15:03:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-01 15:03:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 560 transitions. [2018-12-01 15:03:16,363 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 560 transitions. Word has length 28 [2018-12-01 15:03:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:16,363 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 560 transitions. [2018-12-01 15:03:16,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 560 transitions. [2018-12-01 15:03:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 15:03:16,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:16,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:16,364 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:16,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1226553269, now seen corresponding path program 1 times [2018-12-01 15:03:16,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:16,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:16,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:16,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:16,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:16,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:16,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:16,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,438 INFO L87 Difference]: Start difference. First operand 423 states and 560 transitions. Second operand 3 states. [2018-12-01 15:03:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:16,482 INFO L93 Difference]: Finished difference Result 913 states and 1215 transitions. [2018-12-01 15:03:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:16,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 15:03:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:16,487 INFO L225 Difference]: With dead ends: 913 [2018-12-01 15:03:16,487 INFO L226 Difference]: Without dead ends: 651 [2018-12-01 15:03:16,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01 15:03:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-01 15:03:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 620. [2018-12-01 15:03:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-12-01 15:03:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 828 transitions. [2018-12-01 15:03:16,522 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 828 transitions. Word has length 30 [2018-12-01 15:03:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:16,523 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 828 transitions. [2018-12-01 15:03:16,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 828 transitions. [2018-12-01 15:03:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 15:03:16,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:16,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:16,524 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:16,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2035434096, now seen corresponding path program 1 times [2018-12-01 15:03:16,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:16,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:16,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:16,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:16,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,565 INFO L87 Difference]: Start difference. First operand 620 states and 828 transitions. Second operand 3 states. [2018-12-01 15:03:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:16,594 INFO L93 Difference]: Finished difference Result 715 states and 947 transitions. [2018-12-01 15:03:16,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:16,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 15:03:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:16,596 INFO L225 Difference]: With dead ends: 715 [2018-12-01 15:03:16,596 INFO L226 Difference]: Without dead ends: 697 [2018-12-01 15:03:16,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01 15:03:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-12-01 15:03:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 658. [2018-12-01 15:03:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-12-01 15:03:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 877 transitions. [2018-12-01 15:03:16,619 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 877 transitions. Word has length 34 [2018-12-01 15:03:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:16,619 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 877 transitions. [2018-12-01 15:03:16,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 877 transitions. [2018-12-01 15:03:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-01 15:03:16,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:16,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:16,621 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:16,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash 897056749, now seen corresponding path program 1 times [2018-12-01 15:03:16,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:16,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:16,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:16,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:16,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:16,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,649 INFO L87 Difference]: Start difference. First operand 658 states and 877 transitions. Second operand 3 states. [2018-12-01 15:03:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:16,746 INFO L93 Difference]: Finished difference Result 1029 states and 1392 transitions. [2018-12-01 15:03:16,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:16,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-01 15:03:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:16,749 INFO L225 Difference]: With dead ends: 1029 [2018-12-01 15:03:16,749 INFO L226 Difference]: Without dead ends: 1026 [2018-12-01 15:03:16,750 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-01 15:03:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-12-01 15:03:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 781. [2018-12-01 15:03:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-12-01 15:03:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1046 transitions. [2018-12-01 15:03:16,774 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1046 transitions. Word has length 41 [2018-12-01 15:03:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:16,774 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1046 transitions. [2018-12-01 15:03:16,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1046 transitions. [2018-12-01 15:03:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 15:03:16,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:16,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:16,775 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:16,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:16,776 INFO L82 PathProgramCache]: Analyzing trace with hash 999260852, now seen corresponding path program 1 times [2018-12-01 15:03:16,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:16,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:16,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:16,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:16,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:16,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:16,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,811 INFO L87 Difference]: Start difference. First operand 781 states and 1046 transitions. Second operand 3 states. [2018-12-01 15:03:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:16,866 INFO L93 Difference]: Finished difference Result 796 states and 1066 transitions. [2018-12-01 15:03:16,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:16,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-01 15:03:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:16,869 INFO L225 Difference]: With dead ends: 796 [2018-12-01 15:03:16,869 INFO L226 Difference]: Without dead ends: 793 [2018-12-01 15:03:16,869 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-01 15:03:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-01 15:03:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 792. [2018-12-01 15:03:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-12-01 15:03:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1060 transitions. [2018-12-01 15:03:16,892 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1060 transitions. Word has length 40 [2018-12-01 15:03:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:16,892 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1060 transitions. [2018-12-01 15:03:16,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1060 transitions. [2018-12-01 15:03:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-01 15:03:16,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:16,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:16,893 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:16,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1052368345, now seen corresponding path program 1 times [2018-12-01 15:03:16,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:16,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:16,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:16,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:16,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:16,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:16,916 INFO L87 Difference]: Start difference. First operand 792 states and 1060 transitions. Second operand 3 states. [2018-12-01 15:03:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:16,992 INFO L93 Difference]: Finished difference Result 824 states and 1098 transitions. [2018-12-01 15:03:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:16,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-01 15:03:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:16,996 INFO L225 Difference]: With dead ends: 824 [2018-12-01 15:03:16,996 INFO L226 Difference]: Without dead ends: 819 [2018-12-01 15:03:16,997 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-01 15:03:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-01 15:03:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2018-12-01 15:03:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-01 15:03:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1091 transitions. [2018-12-01 15:03:17,022 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1091 transitions. Word has length 41 [2018-12-01 15:03:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:17,022 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1091 transitions. [2018-12-01 15:03:17,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1091 transitions. [2018-12-01 15:03:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 15:03:17,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:17,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:17,024 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:17,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1801128385, now seen corresponding path program 1 times [2018-12-01 15:03:17,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:17,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:17,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:17,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:17,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:17,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:17,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:17,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:17,061 INFO L87 Difference]: Start difference. First operand 817 states and 1091 transitions. Second operand 5 states. [2018-12-01 15:03:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:17,447 INFO L93 Difference]: Finished difference Result 1536 states and 2036 transitions. [2018-12-01 15:03:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:17,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-01 15:03:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:17,451 INFO L225 Difference]: With dead ends: 1536 [2018-12-01 15:03:17,451 INFO L226 Difference]: Without dead ends: 985 [2018-12-01 15:03:17,453 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-01 15:03:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-12-01 15:03:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 808. [2018-12-01 15:03:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-01 15:03:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1070 transitions. [2018-12-01 15:03:17,489 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1070 transitions. Word has length 42 [2018-12-01 15:03:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:17,489 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1070 transitions. [2018-12-01 15:03:17,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1070 transitions. [2018-12-01 15:03:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 15:03:17,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:17,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:17,491 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:17,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:17,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1284438240, now seen corresponding path program 1 times [2018-12-01 15:03:17,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:17,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:17,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:17,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:17,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:17,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:17,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:17,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:17,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:17,529 INFO L87 Difference]: Start difference. First operand 808 states and 1070 transitions. Second operand 5 states. [2018-12-01 15:03:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:17,761 INFO L93 Difference]: Finished difference Result 816 states and 1076 transitions. [2018-12-01 15:03:17,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:17,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-01 15:03:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:17,765 INFO L225 Difference]: With dead ends: 816 [2018-12-01 15:03:17,765 INFO L226 Difference]: Without dead ends: 810 [2018-12-01 15:03:17,765 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-01 15:03:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-12-01 15:03:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-12-01 15:03:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-01 15:03:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1069 transitions. [2018-12-01 15:03:17,806 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1069 transitions. Word has length 42 [2018-12-01 15:03:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:17,806 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1069 transitions. [2018-12-01 15:03:17,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1069 transitions. [2018-12-01 15:03:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 15:03:17,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:17,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:17,808 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:17,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2023267546, now seen corresponding path program 1 times [2018-12-01 15:03:17,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:17,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:17,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:17,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:17,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:17,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:17,851 INFO L87 Difference]: Start difference. First operand 808 states and 1069 transitions. Second operand 5 states. [2018-12-01 15:03:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:18,058 INFO L93 Difference]: Finished difference Result 816 states and 1075 transitions. [2018-12-01 15:03:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:18,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-01 15:03:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:18,061 INFO L225 Difference]: With dead ends: 816 [2018-12-01 15:03:18,061 INFO L226 Difference]: Without dead ends: 810 [2018-12-01 15:03:18,062 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-01 15:03:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-12-01 15:03:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-12-01 15:03:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-01 15:03:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1068 transitions. [2018-12-01 15:03:18,088 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1068 transitions. Word has length 43 [2018-12-01 15:03:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:18,088 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1068 transitions. [2018-12-01 15:03:18,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1068 transitions. [2018-12-01 15:03:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-01 15:03:18,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:18,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:18,090 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:18,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1786995081, now seen corresponding path program 1 times [2018-12-01 15:03:18,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:18,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:18,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:18,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:18,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:18,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:18,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:18,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:18,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:18,117 INFO L87 Difference]: Start difference. First operand 808 states and 1068 transitions. Second operand 5 states. [2018-12-01 15:03:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:18,151 INFO L93 Difference]: Finished difference Result 824 states and 1083 transitions. [2018-12-01 15:03:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:18,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-01 15:03:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:18,153 INFO L225 Difference]: With dead ends: 824 [2018-12-01 15:03:18,153 INFO L226 Difference]: Without dead ends: 806 [2018-12-01 15:03:18,153 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-01 15:03:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-12-01 15:03:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2018-12-01 15:03:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-12-01 15:03:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1064 transitions. [2018-12-01 15:03:18,180 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1064 transitions. Word has length 44 [2018-12-01 15:03:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:18,180 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1064 transitions. [2018-12-01 15:03:18,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1064 transitions. [2018-12-01 15:03:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-01 15:03:18,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:18,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:18,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:18,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1151742481, now seen corresponding path program 1 times [2018-12-01 15:03:18,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:18,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:18,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:18,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 15:03:18,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:03:18,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:03:18,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:03:18,203 INFO L87 Difference]: Start difference. First operand 806 states and 1064 transitions. Second operand 4 states. [2018-12-01 15:03:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:18,328 INFO L93 Difference]: Finished difference Result 890 states and 1147 transitions. [2018-12-01 15:03:18,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:03:18,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-01 15:03:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:18,330 INFO L225 Difference]: With dead ends: 890 [2018-12-01 15:03:18,330 INFO L226 Difference]: Without dead ends: 557 [2018-12-01 15:03:18,331 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-01 15:03:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-12-01 15:03:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 520. [2018-12-01 15:03:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-01 15:03:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 659 transitions. [2018-12-01 15:03:18,354 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 659 transitions. Word has length 49 [2018-12-01 15:03:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:18,354 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 659 transitions. [2018-12-01 15:03:18,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:03:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 659 transitions. [2018-12-01 15:03:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 15:03:18,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:18,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:18,356 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:18,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1304384875, now seen corresponding path program 1 times [2018-12-01 15:03:18,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:18,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:18,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:18,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:18,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:18,389 INFO L87 Difference]: Start difference. First operand 520 states and 659 transitions. Second operand 3 states. [2018-12-01 15:03:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:18,450 INFO L93 Difference]: Finished difference Result 789 states and 1008 transitions. [2018-12-01 15:03:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:18,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-01 15:03:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:18,451 INFO L225 Difference]: With dead ends: 789 [2018-12-01 15:03:18,451 INFO L226 Difference]: Without dead ends: 528 [2018-12-01 15:03:18,452 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-01 15:03:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-12-01 15:03:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-12-01 15:03:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-01 15:03:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 670 transitions. [2018-12-01 15:03:18,469 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 670 transitions. Word has length 55 [2018-12-01 15:03:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:18,469 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 670 transitions. [2018-12-01 15:03:18,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 670 transitions. [2018-12-01 15:03:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 15:03:18,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:18,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:18,470 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:18,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1872524112, now seen corresponding path program 1 times [2018-12-01 15:03:18,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:18,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:18,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:18,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:18,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:18,490 INFO L87 Difference]: Start difference. First operand 528 states and 670 transitions. Second operand 3 states. [2018-12-01 15:03:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:18,581 INFO L93 Difference]: Finished difference Result 720 states and 928 transitions. [2018-12-01 15:03:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:18,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-01 15:03:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:18,583 INFO L225 Difference]: With dead ends: 720 [2018-12-01 15:03:18,583 INFO L226 Difference]: Without dead ends: 712 [2018-12-01 15:03:18,584 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-01 15:03:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-12-01 15:03:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 582. [2018-12-01 15:03:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-12-01 15:03:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 738 transitions. [2018-12-01 15:03:18,605 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 738 transitions. Word has length 52 [2018-12-01 15:03:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:18,605 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 738 transitions. [2018-12-01 15:03:18,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 738 transitions. [2018-12-01 15:03:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 15:03:18,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:18,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:18,606 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:18,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1629136409, now seen corresponding path program 1 times [2018-12-01 15:03:18,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:18,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:18,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:18,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 15:03:18,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 15:03:18,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 15:03:18,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:03:18,653 INFO L87 Difference]: Start difference. First operand 582 states and 738 transitions. Second operand 8 states. [2018-12-01 15:03:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:18,761 INFO L93 Difference]: Finished difference Result 612 states and 772 transitions. [2018-12-01 15:03:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:03:18,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-01 15:03:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:18,763 INFO L225 Difference]: With dead ends: 612 [2018-12-01 15:03:18,763 INFO L226 Difference]: Without dead ends: 608 [2018-12-01 15:03:18,763 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-01 15:03:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-01 15:03:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-12-01 15:03:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-01 15:03:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2018-12-01 15:03:18,785 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 53 [2018-12-01 15:03:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:18,786 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2018-12-01 15:03:18,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 15:03:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2018-12-01 15:03:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 15:03:18,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:18,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:18,787 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:18,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:18,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1629413239, now seen corresponding path program 1 times [2018-12-01 15:03:18,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:18,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:18,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:18,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 15:03:18,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 15:03:18,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 15:03:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:03:18,836 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 8 states. [2018-12-01 15:03:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:18,901 INFO L93 Difference]: Finished difference Result 1000 states and 1288 transitions. [2018-12-01 15:03:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:03:18,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-01 15:03:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:18,903 INFO L225 Difference]: With dead ends: 1000 [2018-12-01 15:03:18,903 INFO L226 Difference]: Without dead ends: 649 [2018-12-01 15:03:18,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:03:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-01 15:03:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2018-12-01 15:03:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-12-01 15:03:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 804 transitions. [2018-12-01 15:03:18,925 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 804 transitions. Word has length 53 [2018-12-01 15:03:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:18,925 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 804 transitions. [2018-12-01 15:03:18,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 15:03:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 804 transitions. [2018-12-01 15:03:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-01 15:03:18,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:18,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:18,927 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:18,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1678961307, now seen corresponding path program 1 times [2018-12-01 15:03:18,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:18,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:19,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:19,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:19,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:19,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:19,017 INFO L87 Difference]: Start difference. First operand 629 states and 804 transitions. Second operand 5 states. [2018-12-01 15:03:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:19,046 INFO L93 Difference]: Finished difference Result 884 states and 1133 transitions. [2018-12-01 15:03:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:19,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-01 15:03:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:19,048 INFO L225 Difference]: With dead ends: 884 [2018-12-01 15:03:19,048 INFO L226 Difference]: Without dead ends: 610 [2018-12-01 15:03:19,049 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-01 15:03:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-12-01 15:03:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2018-12-01 15:03:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-01 15:03:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-12-01 15:03:19,070 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 61 [2018-12-01 15:03:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:19,071 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-12-01 15:03:19,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-12-01 15:03:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 15:03:19,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:19,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:19,072 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:19,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1631638869, now seen corresponding path program 1 times [2018-12-01 15:03:19,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:19,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:19,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:19,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:19,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:19,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:19,093 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 3 states. [2018-12-01 15:03:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:19,167 INFO L93 Difference]: Finished difference Result 709 states and 896 transitions. [2018-12-01 15:03:19,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:19,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-01 15:03:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:19,169 INFO L225 Difference]: With dead ends: 709 [2018-12-01 15:03:19,169 INFO L226 Difference]: Without dead ends: 684 [2018-12-01 15:03:19,170 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-01 15:03:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-12-01 15:03:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 674. [2018-12-01 15:03:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-12-01 15:03:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 855 transitions. [2018-12-01 15:03:19,193 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 855 transitions. Word has length 54 [2018-12-01 15:03:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:19,193 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 855 transitions. [2018-12-01 15:03:19,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 855 transitions. [2018-12-01 15:03:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 15:03:19,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:19,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:19,195 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:19,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1488359511, now seen corresponding path program 1 times [2018-12-01 15:03:19,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:19,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:19,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:19,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:19,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:03:19,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:03:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:03:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:03:19,247 INFO L87 Difference]: Start difference. First operand 674 states and 855 transitions. Second operand 7 states. [2018-12-01 15:03:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:19,647 INFO L93 Difference]: Finished difference Result 708 states and 893 transitions. [2018-12-01 15:03:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:19,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-01 15:03:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:19,649 INFO L225 Difference]: With dead ends: 708 [2018-12-01 15:03:19,649 INFO L226 Difference]: Without dead ends: 604 [2018-12-01 15:03:19,650 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-01 15:03:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-12-01 15:03:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 582. [2018-12-01 15:03:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-12-01 15:03:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 732 transitions. [2018-12-01 15:03:19,672 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 732 transitions. Word has length 54 [2018-12-01 15:03:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:19,672 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 732 transitions. [2018-12-01 15:03:19,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:03:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 732 transitions. [2018-12-01 15:03:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 15:03:19,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:19,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:19,673 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:19,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash 39700081, now seen corresponding path program 1 times [2018-12-01 15:03:19,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:19,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:19,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:19,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:19,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:19,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:19,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:19,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:19,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:19,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:19,728 INFO L87 Difference]: Start difference. First operand 582 states and 732 transitions. Second operand 9 states. [2018-12-01 15:03:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:20,478 INFO L93 Difference]: Finished difference Result 777 states and 972 transitions. [2018-12-01 15:03:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 15:03:20,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-12-01 15:03:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:20,481 INFO L225 Difference]: With dead ends: 777 [2018-12-01 15:03:20,481 INFO L226 Difference]: Without dead ends: 701 [2018-12-01 15:03:20,482 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-01 15:03:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-12-01 15:03:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 589. [2018-12-01 15:03:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-12-01 15:03:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 733 transitions. [2018-12-01 15:03:20,525 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 733 transitions. Word has length 54 [2018-12-01 15:03:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:20,525 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 733 transitions. [2018-12-01 15:03:20,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 733 transitions. [2018-12-01 15:03:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 15:03:20,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:20,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:20,526 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:20,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -381110486, now seen corresponding path program 1 times [2018-12-01 15:03:20,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:20,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:20,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:20,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-01 15:03:20,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:20,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:03:20,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:03:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:03:20,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:03:20,561 INFO L87 Difference]: Start difference. First operand 589 states and 733 transitions. Second operand 6 states. [2018-12-01 15:03:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:20,609 INFO L93 Difference]: Finished difference Result 608 states and 752 transitions. [2018-12-01 15:03:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:20,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-01 15:03:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:20,612 INFO L225 Difference]: With dead ends: 608 [2018-12-01 15:03:20,612 INFO L226 Difference]: Without dead ends: 569 [2018-12-01 15:03:20,612 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-01 15:03:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-12-01 15:03:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2018-12-01 15:03:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-12-01 15:03:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 708 transitions. [2018-12-01 15:03:20,648 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 708 transitions. Word has length 57 [2018-12-01 15:03:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:20,648 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 708 transitions. [2018-12-01 15:03:20,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:03:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 708 transitions. [2018-12-01 15:03:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 15:03:20,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:20,650 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:20,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1488177932, now seen corresponding path program 1 times [2018-12-01 15:03:20,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:20,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:20,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:20,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:20,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:20,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:20,705 INFO L87 Difference]: Start difference. First operand 569 states and 708 transitions. Second operand 5 states. [2018-12-01 15:03:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:20,880 INFO L93 Difference]: Finished difference Result 581 states and 719 transitions. [2018-12-01 15:03:20,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:20,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-01 15:03:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:20,882 INFO L225 Difference]: With dead ends: 581 [2018-12-01 15:03:20,882 INFO L226 Difference]: Without dead ends: 563 [2018-12-01 15:03:20,883 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-01 15:03:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-12-01 15:03:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 552. [2018-12-01 15:03:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-01 15:03:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2018-12-01 15:03:20,904 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 56 [2018-12-01 15:03:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:20,904 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2018-12-01 15:03:20,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2018-12-01 15:03:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 15:03:20,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:20,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:20,905 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:20,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash -12265598, now seen corresponding path program 1 times [2018-12-01 15:03:20,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:20,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:20,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:20,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:20,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:20,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:20,936 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 5 states. [2018-12-01 15:03:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:21,118 INFO L93 Difference]: Finished difference Result 811 states and 1012 transitions. [2018-12-01 15:03:21,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:21,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-01 15:03:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:21,119 INFO L225 Difference]: With dead ends: 811 [2018-12-01 15:03:21,119 INFO L226 Difference]: Without dead ends: 552 [2018-12-01 15:03:21,120 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-01 15:03:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-12-01 15:03:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2018-12-01 15:03:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-01 15:03:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-12-01 15:03:21,142 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 65 [2018-12-01 15:03:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:21,142 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-12-01 15:03:21,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-12-01 15:03:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 15:03:21,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:21,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:21,143 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:21,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 118426915, now seen corresponding path program 1 times [2018-12-01 15:03:21,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:21,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:21,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:03:21,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:03:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:03:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:03:21,164 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 3 states. [2018-12-01 15:03:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:21,203 INFO L93 Difference]: Finished difference Result 837 states and 1046 transitions. [2018-12-01 15:03:21,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:03:21,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-01 15:03:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:21,204 INFO L225 Difference]: With dead ends: 837 [2018-12-01 15:03:21,204 INFO L226 Difference]: Without dead ends: 578 [2018-12-01 15:03:21,205 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-01 15:03:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-12-01 15:03:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 552. [2018-12-01 15:03:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-01 15:03:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-12-01 15:03:21,227 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 68 [2018-12-01 15:03:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:21,227 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-12-01 15:03:21,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:03:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-12-01 15:03:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 15:03:21,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:21,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:21,228 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:21,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2112462179, now seen corresponding path program 1 times [2018-12-01 15:03:21,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:21,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:21,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:21,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:21,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:03:21,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:03:21,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:03:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:03:21,269 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 6 states. [2018-12-01 15:03:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:21,318 INFO L93 Difference]: Finished difference Result 805 states and 1000 transitions. [2018-12-01 15:03:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:21,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-01 15:03:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:21,320 INFO L225 Difference]: With dead ends: 805 [2018-12-01 15:03:21,320 INFO L226 Difference]: Without dead ends: 579 [2018-12-01 15:03:21,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:03:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-01 15:03:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 552. [2018-12-01 15:03:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-01 15:03:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 679 transitions. [2018-12-01 15:03:21,343 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 679 transitions. Word has length 68 [2018-12-01 15:03:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:21,343 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 679 transitions. [2018-12-01 15:03:21,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:03:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 679 transitions. [2018-12-01 15:03:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 15:03:21,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:21,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:21,344 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:21,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:21,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1566897792, now seen corresponding path program 1 times [2018-12-01 15:03:21,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:21,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:21,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:21,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:21,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:21,381 INFO L87 Difference]: Start difference. First operand 552 states and 679 transitions. Second operand 9 states. [2018-12-01 15:03:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:21,529 INFO L93 Difference]: Finished difference Result 569 states and 696 transitions. [2018-12-01 15:03:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:21,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-01 15:03:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:21,531 INFO L225 Difference]: With dead ends: 569 [2018-12-01 15:03:21,531 INFO L226 Difference]: Without dead ends: 548 [2018-12-01 15:03:21,532 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-01 15:03:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-12-01 15:03:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2018-12-01 15:03:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-12-01 15:03:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 673 transitions. [2018-12-01 15:03:21,562 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 673 transitions. Word has length 60 [2018-12-01 15:03:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:21,563 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 673 transitions. [2018-12-01 15:03:21,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 673 transitions. [2018-12-01 15:03:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-01 15:03:21,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:21,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:21,564 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:21,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -938148036, now seen corresponding path program 1 times [2018-12-01 15:03:21,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:21,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:21,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:21,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:21,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:21,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:21,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:21,618 INFO L87 Difference]: Start difference. First operand 548 states and 673 transitions. Second operand 9 states. [2018-12-01 15:03:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:21,728 INFO L93 Difference]: Finished difference Result 565 states and 690 transitions. [2018-12-01 15:03:21,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:21,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-01 15:03:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:21,730 INFO L225 Difference]: With dead ends: 565 [2018-12-01 15:03:21,730 INFO L226 Difference]: Without dead ends: 543 [2018-12-01 15:03:21,731 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-01 15:03:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-01 15:03:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2018-12-01 15:03:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-12-01 15:03:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 666 transitions. [2018-12-01 15:03:21,766 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 666 transitions. Word has length 61 [2018-12-01 15:03:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:21,766 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 666 transitions. [2018-12-01 15:03:21,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 666 transitions. [2018-12-01 15:03:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-01 15:03:21,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:21,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:21,767 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:21,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1868259506, now seen corresponding path program 1 times [2018-12-01 15:03:21,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:21,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:21,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:21,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:21,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:21,815 INFO L87 Difference]: Start difference. First operand 543 states and 666 transitions. Second operand 9 states. [2018-12-01 15:03:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:21,926 INFO L93 Difference]: Finished difference Result 560 states and 683 transitions. [2018-12-01 15:03:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:21,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-01 15:03:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:21,928 INFO L225 Difference]: With dead ends: 560 [2018-12-01 15:03:21,928 INFO L226 Difference]: Without dead ends: 539 [2018-12-01 15:03:21,928 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-01 15:03:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-12-01 15:03:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2018-12-01 15:03:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-12-01 15:03:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 660 transitions. [2018-12-01 15:03:21,950 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 660 transitions. Word has length 61 [2018-12-01 15:03:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:21,950 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 660 transitions. [2018-12-01 15:03:21,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 660 transitions. [2018-12-01 15:03:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 15:03:21,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:21,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:21,951 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:21,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1408260900, now seen corresponding path program 1 times [2018-12-01 15:03:21,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:21,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:22,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:22,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:22,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:22,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:22,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:22,006 INFO L87 Difference]: Start difference. First operand 539 states and 660 transitions. Second operand 5 states. [2018-12-01 15:03:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:22,254 INFO L93 Difference]: Finished difference Result 896 states and 1107 transitions. [2018-12-01 15:03:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:22,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-01 15:03:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:22,257 INFO L225 Difference]: With dead ends: 896 [2018-12-01 15:03:22,257 INFO L226 Difference]: Without dead ends: 643 [2018-12-01 15:03:22,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:03:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-12-01 15:03:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 613. [2018-12-01 15:03:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-12-01 15:03:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 754 transitions. [2018-12-01 15:03:22,287 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 754 transitions. Word has length 67 [2018-12-01 15:03:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:22,287 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 754 transitions. [2018-12-01 15:03:22,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 754 transitions. [2018-12-01 15:03:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 15:03:22,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:22,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:22,289 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:22,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1726599875, now seen corresponding path program 1 times [2018-12-01 15:03:22,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:22,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:22,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:22,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:22,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:22,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:22,346 INFO L87 Difference]: Start difference. First operand 613 states and 754 transitions. Second operand 9 states. [2018-12-01 15:03:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:22,527 INFO L93 Difference]: Finished difference Result 630 states and 771 transitions. [2018-12-01 15:03:22,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:22,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-12-01 15:03:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:22,529 INFO L225 Difference]: With dead ends: 630 [2018-12-01 15:03:22,530 INFO L226 Difference]: Without dead ends: 587 [2018-12-01 15:03:22,530 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-01 15:03:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-12-01 15:03:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-12-01 15:03:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-12-01 15:03:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 722 transitions. [2018-12-01 15:03:22,580 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 722 transitions. Word has length 65 [2018-12-01 15:03:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:22,580 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 722 transitions. [2018-12-01 15:03:22,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 722 transitions. [2018-12-01 15:03:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-01 15:03:22,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:22,582 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:22,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1495752637, now seen corresponding path program 1 times [2018-12-01 15:03:22,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:22,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:22,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:22,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:22,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:03:22,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:03:22,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:03:22,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:03:22,668 INFO L87 Difference]: Start difference. First operand 587 states and 722 transitions. Second operand 7 states. [2018-12-01 15:03:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:23,115 INFO L93 Difference]: Finished difference Result 891 states and 1100 transitions. [2018-12-01 15:03:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:03:23,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-12-01 15:03:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:23,117 INFO L225 Difference]: With dead ends: 891 [2018-12-01 15:03:23,117 INFO L226 Difference]: Without dead ends: 582 [2018-12-01 15:03:23,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-01 15:03:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-12-01 15:03:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 571. [2018-12-01 15:03:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-12-01 15:03:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 697 transitions. [2018-12-01 15:03:23,143 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 697 transitions. Word has length 79 [2018-12-01 15:03:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:23,143 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 697 transitions. [2018-12-01 15:03:23,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:03:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 697 transitions. [2018-12-01 15:03:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-01 15:03:23,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:23,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:23,144 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:23,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash -229993641, now seen corresponding path program 1 times [2018-12-01 15:03:23,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:23,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:23,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-01 15:03:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:23,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:03:23,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:03:23,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:03:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:03:23,190 INFO L87 Difference]: Start difference. First operand 571 states and 697 transitions. Second operand 6 states. [2018-12-01 15:03:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:23,251 INFO L93 Difference]: Finished difference Result 888 states and 1109 transitions. [2018-12-01 15:03:23,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:23,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-12-01 15:03:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:23,253 INFO L225 Difference]: With dead ends: 888 [2018-12-01 15:03:23,253 INFO L226 Difference]: Without dead ends: 634 [2018-12-01 15:03:23,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:03:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-12-01 15:03:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 537. [2018-12-01 15:03:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-01 15:03:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 653 transitions. [2018-12-01 15:03:23,294 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 653 transitions. Word has length 80 [2018-12-01 15:03:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:23,294 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 653 transitions. [2018-12-01 15:03:23,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:03:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 653 transitions. [2018-12-01 15:03:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-01 15:03:23,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:23,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:23,296 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:23,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:23,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1921735627, now seen corresponding path program 1 times [2018-12-01 15:03:23,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:23,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:23,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:23,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:23,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:23,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:23,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:23,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:23,324 INFO L87 Difference]: Start difference. First operand 537 states and 653 transitions. Second operand 5 states. [2018-12-01 15:03:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:23,580 INFO L93 Difference]: Finished difference Result 973 states and 1159 transitions. [2018-12-01 15:03:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:23,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-01 15:03:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:23,582 INFO L225 Difference]: With dead ends: 973 [2018-12-01 15:03:23,582 INFO L226 Difference]: Without dead ends: 603 [2018-12-01 15:03:23,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-01 15:03:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-12-01 15:03:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 580. [2018-12-01 15:03:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-01 15:03:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 690 transitions. [2018-12-01 15:03:23,609 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 690 transitions. Word has length 75 [2018-12-01 15:03:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:23,610 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 690 transitions. [2018-12-01 15:03:23,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 690 transitions. [2018-12-01 15:03:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 15:03:23,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:23,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:23,611 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:23,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1118408541, now seen corresponding path program 1 times [2018-12-01 15:03:23,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:23,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:23,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:23,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:23,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:23,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:23,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:23,663 INFO L87 Difference]: Start difference. First operand 580 states and 690 transitions. Second operand 9 states. [2018-12-01 15:03:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:23,762 INFO L93 Difference]: Finished difference Result 582 states and 691 transitions. [2018-12-01 15:03:23,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:23,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-12-01 15:03:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:23,764 INFO L225 Difference]: With dead ends: 582 [2018-12-01 15:03:23,764 INFO L226 Difference]: Without dead ends: 446 [2018-12-01 15:03:23,764 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-01 15:03:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-01 15:03:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-12-01 15:03:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-12-01 15:03:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 532 transitions. [2018-12-01 15:03:23,786 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 532 transitions. Word has length 78 [2018-12-01 15:03:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:23,786 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 532 transitions. [2018-12-01 15:03:23,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 532 transitions. [2018-12-01 15:03:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 15:03:23,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:23,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:23,787 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:23,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash -534163168, now seen corresponding path program 1 times [2018-12-01 15:03:23,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:23,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:23,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:23,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:23,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:23,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:23,834 INFO L87 Difference]: Start difference. First operand 446 states and 532 transitions. Second operand 9 states. [2018-12-01 15:03:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:23,936 INFO L93 Difference]: Finished difference Result 467 states and 554 transitions. [2018-12-01 15:03:23,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:23,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-12-01 15:03:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:23,937 INFO L225 Difference]: With dead ends: 467 [2018-12-01 15:03:23,938 INFO L226 Difference]: Without dead ends: 446 [2018-12-01 15:03:23,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-01 15:03:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-01 15:03:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-12-01 15:03:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-12-01 15:03:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 531 transitions. [2018-12-01 15:03:23,974 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 531 transitions. Word has length 85 [2018-12-01 15:03:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:23,975 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 531 transitions. [2018-12-01 15:03:23,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 531 transitions. [2018-12-01 15:03:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 15:03:23,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:23,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:23,975 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:23,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1730477814, now seen corresponding path program 1 times [2018-12-01 15:03:23,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:24,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:24,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:03:24,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:03:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:03:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:03:24,004 INFO L87 Difference]: Start difference. First operand 446 states and 531 transitions. Second operand 6 states. [2018-12-01 15:03:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:24,047 INFO L93 Difference]: Finished difference Result 479 states and 563 transitions. [2018-12-01 15:03:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:24,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-01 15:03:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:24,049 INFO L225 Difference]: With dead ends: 479 [2018-12-01 15:03:24,049 INFO L226 Difference]: Without dead ends: 440 [2018-12-01 15:03:24,049 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-01 15:03:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-12-01 15:03:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2018-12-01 15:03:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-01 15:03:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 455 transitions. [2018-12-01 15:03:24,083 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 455 transitions. Word has length 96 [2018-12-01 15:03:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:24,083 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 455 transitions. [2018-12-01 15:03:24,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:03:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 455 transitions. [2018-12-01 15:03:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 15:03:24,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:24,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:24,085 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:24,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash -342402432, now seen corresponding path program 1 times [2018-12-01 15:03:24,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:24,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:24,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:24,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:03:24,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:03:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:03:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:03:24,128 INFO L87 Difference]: Start difference. First operand 387 states and 455 transitions. Second operand 7 states. [2018-12-01 15:03:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:24,265 INFO L93 Difference]: Finished difference Result 730 states and 864 transitions. [2018-12-01 15:03:24,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:24,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-01 15:03:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:24,267 INFO L225 Difference]: With dead ends: 730 [2018-12-01 15:03:24,267 INFO L226 Difference]: Without dead ends: 685 [2018-12-01 15:03:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-01 15:03:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-12-01 15:03:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 367. [2018-12-01 15:03:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-01 15:03:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 430 transitions. [2018-12-01 15:03:24,306 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 430 transitions. Word has length 96 [2018-12-01 15:03:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:24,306 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 430 transitions. [2018-12-01 15:03:24,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:03:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 430 transitions. [2018-12-01 15:03:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-01 15:03:24,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:24,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:24,308 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:24,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:24,308 INFO L82 PathProgramCache]: Analyzing trace with hash 730694435, now seen corresponding path program 1 times [2018-12-01 15:03:24,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:24,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:03:24,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:24,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 15:03:24,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 15:03:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 15:03:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-01 15:03:24,391 INFO L87 Difference]: Start difference. First operand 367 states and 430 transitions. Second operand 11 states. [2018-12-01 15:03:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:24,469 INFO L93 Difference]: Finished difference Result 512 states and 604 transitions. [2018-12-01 15:03:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:03:24,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-12-01 15:03:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:24,470 INFO L225 Difference]: With dead ends: 512 [2018-12-01 15:03:24,470 INFO L226 Difference]: Without dead ends: 363 [2018-12-01 15:03:24,470 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-01 15:03:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-01 15:03:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2018-12-01 15:03:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-12-01 15:03:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 407 transitions. [2018-12-01 15:03:24,490 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 407 transitions. Word has length 101 [2018-12-01 15:03:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:24,491 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 407 transitions. [2018-12-01 15:03:24,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 15:03:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 407 transitions. [2018-12-01 15:03:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-01 15:03:24,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:24,492 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 15:03:24,492 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:24,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1042284347, now seen corresponding path program 1 times [2018-12-01 15:03:24,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:24,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-01 15:03:24,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:24,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:24,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:24,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:24,527 INFO L87 Difference]: Start difference. First operand 350 states and 407 transitions. Second operand 5 states. [2018-12-01 15:03:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:24,566 INFO L93 Difference]: Finished difference Result 601 states and 707 transitions. [2018-12-01 15:03:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:24,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-01 15:03:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:24,568 INFO L225 Difference]: With dead ends: 601 [2018-12-01 15:03:24,568 INFO L226 Difference]: Without dead ends: 349 [2018-12-01 15:03:24,568 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-01 15:03:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-01 15:03:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-12-01 15:03:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-01 15:03:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 405 transitions. [2018-12-01 15:03:24,593 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 405 transitions. Word has length 110 [2018-12-01 15:03:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:24,593 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 405 transitions. [2018-12-01 15:03:24,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 405 transitions. [2018-12-01 15:03:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-01 15:03:24,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:24,594 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 15:03:24,594 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:24,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1716247270, now seen corresponding path program 1 times [2018-12-01 15:03:24,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:24,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 15:03:24,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:24,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:03:24,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:03:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:03:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:03:24,633 INFO L87 Difference]: Start difference. First operand 349 states and 405 transitions. Second operand 6 states. [2018-12-01 15:03:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:24,680 INFO L93 Difference]: Finished difference Result 377 states and 432 transitions. [2018-12-01 15:03:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:24,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-01 15:03:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:24,682 INFO L225 Difference]: With dead ends: 377 [2018-12-01 15:03:24,682 INFO L226 Difference]: Without dead ends: 301 [2018-12-01 15:03:24,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:03:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-01 15:03:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2018-12-01 15:03:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-12-01 15:03:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 265 transitions. [2018-12-01 15:03:24,706 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 265 transitions. Word has length 110 [2018-12-01 15:03:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:24,707 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 265 transitions. [2018-12-01 15:03:24,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:03:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 265 transitions. [2018-12-01 15:03:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-01 15:03:24,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:24,707 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 15:03:24,708 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:24,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 424283100, now seen corresponding path program 1 times [2018-12-01 15:03:24,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:24,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:24,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-01 15:03:24,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:24,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:24,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:24,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:24,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:24,791 INFO L87 Difference]: Start difference. First operand 239 states and 265 transitions. Second operand 9 states. [2018-12-01 15:03:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:24,859 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2018-12-01 15:03:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:24,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-12-01 15:03:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:24,860 INFO L225 Difference]: With dead ends: 312 [2018-12-01 15:03:24,860 INFO L226 Difference]: Without dead ends: 283 [2018-12-01 15:03:24,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-01 15:03:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-01 15:03:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2018-12-01 15:03:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-01 15:03:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2018-12-01 15:03:24,879 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 131 [2018-12-01 15:03:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:24,879 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2018-12-01 15:03:24,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2018-12-01 15:03:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 15:03:24,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:24,880 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 15:03:24,880 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:24,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 765037084, now seen corresponding path program 1 times [2018-12-01 15:03:24,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-01 15:03:24,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:24,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:24,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:24,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:24,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:24,960 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand 9 states. [2018-12-01 15:03:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:25,021 INFO L93 Difference]: Finished difference Result 334 states and 374 transitions. [2018-12-01 15:03:25,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:25,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2018-12-01 15:03:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:25,022 INFO L225 Difference]: With dead ends: 334 [2018-12-01 15:03:25,022 INFO L226 Difference]: Without dead ends: 263 [2018-12-01 15:03:25,022 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-01 15:03:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-01 15:03:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2018-12-01 15:03:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-01 15:03:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 265 transitions. [2018-12-01 15:03:25,037 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 265 transitions. Word has length 132 [2018-12-01 15:03:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:25,037 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 265 transitions. [2018-12-01 15:03:25,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 265 transitions. [2018-12-01 15:03:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 15:03:25,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:25,037 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 15:03:25,037 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:25,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash -672296009, now seen corresponding path program 1 times [2018-12-01 15:03:25,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:25,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-01 15:03:25,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:25,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:03:25,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:03:25,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:03:25,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:03:25,078 INFO L87 Difference]: Start difference. First operand 241 states and 265 transitions. Second operand 5 states. [2018-12-01 15:03:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:25,097 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-12-01 15:03:25,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:03:25,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-01 15:03:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:25,098 INFO L225 Difference]: With dead ends: 277 [2018-12-01 15:03:25,098 INFO L226 Difference]: Without dead ends: 247 [2018-12-01 15:03:25,099 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-01 15:03:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-01 15:03:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-12-01 15:03:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-01 15:03:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 269 transitions. [2018-12-01 15:03:25,113 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 269 transitions. Word has length 147 [2018-12-01 15:03:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:25,113 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 269 transitions. [2018-12-01 15:03:25,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:03:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 269 transitions. [2018-12-01 15:03:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 15:03:25,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:25,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 15:03:25,114 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:25,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash -490809512, now seen corresponding path program 1 times [2018-12-01 15:03:25,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:25,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:25,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:25,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 15:03:25,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:25,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-01 15:03:25,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-01 15:03:25,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 15:03:25,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-01 15:03:25,219 INFO L87 Difference]: Start difference. First operand 245 states and 269 transitions. Second operand 15 states. [2018-12-01 15:03:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:25,358 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2018-12-01 15:03:25,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 15:03:25,359 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-12-01 15:03:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:25,360 INFO L225 Difference]: With dead ends: 311 [2018-12-01 15:03:25,360 INFO L226 Difference]: Without dead ends: 276 [2018-12-01 15:03:25,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-01 15:03:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-01 15:03:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 262. [2018-12-01 15:03:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-01 15:03:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 290 transitions. [2018-12-01 15:03:25,376 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 290 transitions. Word has length 147 [2018-12-01 15:03:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:25,377 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 290 transitions. [2018-12-01 15:03:25,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-01 15:03:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 290 transitions. [2018-12-01 15:03:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-01 15:03:25,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:25,378 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01 15:03:25,378 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:25,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1053414808, now seen corresponding path program 1 times [2018-12-01 15:03:25,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 15:03:25,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:25,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 15:03:25,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 15:03:25,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:03:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:03:25,431 INFO L87 Difference]: Start difference. First operand 262 states and 290 transitions. Second operand 9 states. [2018-12-01 15:03:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:25,491 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2018-12-01 15:03:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:03:25,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-12-01 15:03:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:25,493 INFO L225 Difference]: With dead ends: 351 [2018-12-01 15:03:25,493 INFO L226 Difference]: Without dead ends: 270 [2018-12-01 15:03:25,493 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-01 15:03:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-01 15:03:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2018-12-01 15:03:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-01 15:03:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 289 transitions. [2018-12-01 15:03:25,518 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 289 transitions. Word has length 148 [2018-12-01 15:03:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:25,518 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 289 transitions. [2018-12-01 15:03:25,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 15:03:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 289 transitions. [2018-12-01 15:03:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-01 15:03:25,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:25,519 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01 15:03:25,519 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:25,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1979295687, now seen corresponding path program 1 times [2018-12-01 15:03:25,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:25,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 15:03:25,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:03:25,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/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-01 15:03:25,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:25,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:03:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-01 15:03:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:03:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-12-01 15:03:25,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 15:03:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 15:03:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-01 15:03:25,885 INFO L87 Difference]: Start difference. First operand 262 states and 289 transitions. Second operand 21 states. [2018-12-01 15:03:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:26,015 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2018-12-01 15:03:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 15:03:26,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2018-12-01 15:03:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:26,016 INFO L225 Difference]: With dead ends: 307 [2018-12-01 15:03:26,016 INFO L226 Difference]: Without dead ends: 266 [2018-12-01 15:03:26,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-12-01 15:03:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-01 15:03:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2018-12-01 15:03:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 15:03:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 280 transitions. [2018-12-01 15:03:26,049 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 280 transitions. Word has length 150 [2018-12-01 15:03:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:26,050 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 280 transitions. [2018-12-01 15:03:26,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 15:03:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 280 transitions. [2018-12-01 15:03:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-01 15:03:26,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:26,051 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-12-01 15:03:26,051 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:26,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:26,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2052783288, now seen corresponding path program 1 times [2018-12-01 15:03:26,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:26,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:26,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:26,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:26,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 15:03:26,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:03:26,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 15:03:26,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:26,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:03:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-01 15:03:26,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:03:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-12-01 15:03:26,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-01 15:03:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 15:03:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-01 15:03:26,347 INFO L87 Difference]: Start difference. First operand 256 states and 280 transitions. Second operand 14 states. [2018-12-01 15:03:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:26,517 INFO L93 Difference]: Finished difference Result 317 states and 345 transitions. [2018-12-01 15:03:26,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:03:26,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-12-01 15:03:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:26,518 INFO L225 Difference]: With dead ends: 317 [2018-12-01 15:03:26,519 INFO L226 Difference]: Without dead ends: 242 [2018-12-01 15:03:26,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-01 15:03:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-01 15:03:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 228. [2018-12-01 15:03:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-01 15:03:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 246 transitions. [2018-12-01 15:03:26,546 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 246 transitions. Word has length 155 [2018-12-01 15:03:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:26,546 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 246 transitions. [2018-12-01 15:03:26,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-01 15:03:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 246 transitions. [2018-12-01 15:03:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-01 15:03:26,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:26,547 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-12-01 15:03:26,547 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:26,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1661694165, now seen corresponding path program 1 times [2018-12-01 15:03:26,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:26,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:26,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:26,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 15:03:26,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:26,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:03:26,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:03:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:03:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:03:26,591 INFO L87 Difference]: Start difference. First operand 228 states and 246 transitions. Second operand 6 states. [2018-12-01 15:03:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:26,638 INFO L93 Difference]: Finished difference Result 318 states and 344 transitions. [2018-12-01 15:03:26,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:03:26,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-12-01 15:03:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:26,639 INFO L225 Difference]: With dead ends: 318 [2018-12-01 15:03:26,639 INFO L226 Difference]: Without dead ends: 233 [2018-12-01 15:03:26,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:03:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-01 15:03:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2018-12-01 15:03:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-01 15:03:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 244 transitions. [2018-12-01 15:03:26,670 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 244 transitions. Word has length 157 [2018-12-01 15:03:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:26,670 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 244 transitions. [2018-12-01 15:03:26,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:03:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 244 transitions. [2018-12-01 15:03:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-01 15:03:26,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:26,671 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:26,671 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:26,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash 386317675, now seen corresponding path program 1 times [2018-12-01 15:03:26,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:26,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:26,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-01 15:03:26,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:03:26,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 15:03:26,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 15:03:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 15:03:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:03:26,756 INFO L87 Difference]: Start difference. First operand 227 states and 244 transitions. Second operand 10 states. [2018-12-01 15:03:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:27,159 INFO L93 Difference]: Finished difference Result 448 states and 483 transitions. [2018-12-01 15:03:27,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 15:03:27,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2018-12-01 15:03:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:27,161 INFO L225 Difference]: With dead ends: 448 [2018-12-01 15:03:27,161 INFO L226 Difference]: Without dead ends: 230 [2018-12-01 15:03:27,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-12-01 15:03:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-01 15:03:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-12-01 15:03:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-01 15:03:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 243 transitions. [2018-12-01 15:03:27,179 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 243 transitions. Word has length 158 [2018-12-01 15:03:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:27,179 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 243 transitions. [2018-12-01 15:03:27,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 15:03:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 243 transitions. [2018-12-01 15:03:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-01 15:03:27,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:03:27,180 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:03:27,180 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:03:27,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:03:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1977523987, now seen corresponding path program 1 times [2018-12-01 15:03:27,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:03:27,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:03:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:27,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:03:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-01 15:03:27,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:03:27,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 15:03:27,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:03:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:03:27,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:03:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 15:03:27,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:03:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-12-01 15:03:27,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-01 15:03:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-01 15:03:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-01 15:03:27,505 INFO L87 Difference]: Start difference. First operand 227 states and 243 transitions. Second operand 19 states. [2018-12-01 15:03:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:03:28,146 INFO L93 Difference]: Finished difference Result 298 states and 323 transitions. [2018-12-01 15:03:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 15:03:28,146 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 158 [2018-12-01 15:03:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:03:28,146 INFO L225 Difference]: With dead ends: 298 [2018-12-01 15:03:28,146 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 15:03:28,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-12-01 15:03:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 15:03:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 15:03:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 15:03:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 15:03:28,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2018-12-01 15:03:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:03:28,148 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:03:28,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-01 15:03:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 15:03:28,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 15:03:28,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 15:03:28,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:28,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:29,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:29,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:03:29,454 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 92 [2018-12-01 15:03:29,561 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2018-12-01 15:03:29,972 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 97 [2018-12-01 15:03:30,234 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 59 [2018-12-01 15:03:30,538 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 96 [2018-12-01 15:03:30,741 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2018-12-01 15:03:30,933 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 61 [2018-12-01 15:03:31,202 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 66 [2018-12-01 15:03:31,567 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2018-12-01 15:03:31,859 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2018-12-01 15:03:32,013 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2018-12-01 15:03:32,310 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 66 [2018-12-01 15:03:32,681 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 66 [2018-12-01 15:03:33,212 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 77 [2018-12-01 15:03:33,923 WARN L180 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 107 [2018-12-01 15:03:34,190 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 93 [2018-12-01 15:03:34,298 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2018-12-01 15:03:34,474 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2018-12-01 15:03:34,670 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2018-12-01 15:03:34,962 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-12-01 15:03:35,157 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2018-12-01 15:03:35,289 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2018-12-01 15:03:35,622 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 66 [2018-12-01 15:03:35,773 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2018-12-01 15:03:36,185 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 90 [2018-12-01 15:03:36,377 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-12-01 15:03:36,652 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2018-12-01 15:03:37,281 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 88 [2018-12-01 15:03:37,829 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2018-12-01 15:03:38,054 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 99 [2018-12-01 15:03:38,181 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2018-12-01 15:03:38,772 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-12-01 15:03:39,179 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 99 [2018-12-01 15:03:39,362 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2018-12-01 15:03:39,881 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2018-12-01 15:03:40,226 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-12-01 15:03:40,561 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-12-01 15:03:40,714 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2018-12-01 15:03:41,086 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-12-01 15:03:41,430 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2018-12-01 15:03:41,825 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 78 [2018-12-01 15:03:41,970 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2018-12-01 15:03:42,349 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2018-12-01 15:03:42,468 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2018-12-01 15:03:42,834 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2018-12-01 15:03:42,949 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2018-12-01 15:03:43,209 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2018-12-01 15:03:43,472 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 878 899) no Hoare annotation was computed. [2018-12-01 15:03:43,472 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 878 899) no Hoare annotation was computed. [2018-12-01 15:03:43,472 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 878 899) the Hoare annotation is: true [2018-12-01 15:03:43,472 INFO L451 ceAbstractionStarter]: At program point L888(lines 887 897) the Hoare annotation is: true [2018-12-01 15:03:43,473 INFO L451 ceAbstractionStarter]: At program point L886(lines 885 897) the Hoare annotation is: true [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 897) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 889 896) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 889 896) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 69 89) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 69 89) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (< 0 ~MaximumInterfaceType~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~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) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 69 89) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 900 920) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L451 ceAbstractionStarter]: At program point L909(lines 908 918) the Hoare annotation is: true [2018-12-01 15:03:43,473 INFO L451 ceAbstractionStarter]: At program point L907(lines 906 918) the Hoare annotation is: true [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 918) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 900 920) the Hoare annotation is: true [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 910 917) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 900 920) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 910 917) no Hoare annotation was computed. [2018-12-01 15:03:43,473 INFO L444 ceAbstractionStarter]: At program point L225(lines 224 423) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse5 (+ ~DC~0 2)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L444 ceAbstractionStarter]: At program point L283(line 283) the Hoare annotation is: (let ((.cse0 (and (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L283-1(line 283) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 248) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 428) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L444 ceAbstractionStarter]: At program point L366(line 366) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L399-1(lines 399 403) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L366-1(lines 362 368) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L448 ceAbstractionStarter]: For program point L267-2(lines 267 269) no Hoare annotation was computed. [2018-12-01 15:03:43,474 INFO L444 ceAbstractionStarter]: At program point L391(line 391) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point L391-1(line 391) no Hoare annotation was computed. [2018-12-01 15:03:43,475 INFO L444 ceAbstractionStarter]: At program point L383(line 383) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point L383-1(lines 379 385) no Hoare annotation was computed. [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 425) no Hoare annotation was computed. [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 347) no Hoare annotation was computed. [2018-12-01 15:03:43,475 INFO L444 ceAbstractionStarter]: At program point L210(lines 209 428) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (= ~s~0 1)) (.cse6 (= 0 FloppyPnp_~ntStatus~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6)) (or (and .cse2 .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 231 421) no Hoare annotation was computed. [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 231 421) no Hoare annotation was computed. [2018-12-01 15:03:43,475 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 332) no Hoare annotation was computed. [2018-12-01 15:03:43,476 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 321 333) no Hoare annotation was computed. [2018-12-01 15:03:43,476 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 422) no Hoare annotation was computed. [2018-12-01 15:03:43,476 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse5 (= |old(~s~0)| ~NP~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not .cse5) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse5 (<= .cse6 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse7 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,476 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-12-01 15:03:43,476 INFO L444 ceAbstractionStarter]: At program point L252(line 252) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,476 INFO L448 ceAbstractionStarter]: For program point L252-1(line 252) no Hoare annotation was computed. [2018-12-01 15:03:43,476 INFO L444 ceAbstractionStarter]: At program point L277(line 277) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,477 INFO L448 ceAbstractionStarter]: For program point L277-1(lines 273 279) no Hoare annotation was computed. [2018-12-01 15:03:43,477 INFO L444 ceAbstractionStarter]: At program point L401(line 401) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= 1 ~NP~0) (<= .cse4 ~IPC~0) (= ~SKIP2~0 ~s~0) (<= .cse5 ~MPR1~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (and (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) (= 0 ~compRegistered~0)) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,477 INFO L448 ceAbstractionStarter]: For program point L401-1(line 401) no Hoare annotation was computed. [2018-12-01 15:03:43,477 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 398) no Hoare annotation was computed. [2018-12-01 15:03:43,477 INFO L448 ceAbstractionStarter]: For program point L393-2(lines 231 419) no Hoare annotation was computed. [2018-12-01 15:03:43,477 INFO L444 ceAbstractionStarter]: At program point L228(lines 227 422) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,477 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 197) no Hoare annotation was computed. [2018-12-01 15:03:43,477 INFO L448 ceAbstractionStarter]: For program point L195-2(lines 195 197) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L444 ceAbstractionStarter]: At program point L344(line 344) the Hoare annotation is: (let ((.cse0 (and (<= FloppyPnp_~__cil_tmp30~0 259) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 259 FloppyPnp_~__cil_tmp30~0) (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L344-1(line 344) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 427) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 309) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L444 ceAbstractionStarter]: At program point L328(line 328) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 293) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 424) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L444 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L411-1(lines 407 413) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L444 ceAbstractionStarter]: At program point L246(line 246) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 242 248) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L444 ceAbstractionStarter]: At program point L205(line 205) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L238-1(lines 231 419) no Hoare annotation was computed. [2018-12-01 15:03:43,478 INFO L448 ceAbstractionStarter]: For program point L205-1(line 205) no Hoare annotation was computed. [2018-12-01 15:03:43,479 INFO L444 ceAbstractionStarter]: At program point L395(lines 395 396) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,479 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 368) no Hoare annotation was computed. [2018-12-01 15:03:43,479 INFO L448 ceAbstractionStarter]: For program point L395-1(lines 395 396) no Hoare annotation was computed. [2018-12-01 15:03:43,479 INFO L444 ceAbstractionStarter]: At program point L230(lines 229 422) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse5 (+ ~DC~0 2)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,479 INFO L444 ceAbstractionStarter]: At program point L420(lines 231 421) the Hoare annotation is: (let ((.cse20 (+ ~SKIP1~0 2)) (.cse19 (+ ~DC~0 2)) (.cse21 (+ ~DC~0 5)) (.cse18 (+ ~NP~0 2))) (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse11 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse14 (<= ~compRegistered~0 0)) (.cse6 (<= .cse18 ~SKIP1~0)) (.cse15 (= ~DC~0 ~s~0)) (.cse22 (= 0 ~pended~0)) (.cse8 (<= .cse21 ~IPC~0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= .cse19 ~SKIP2~0)) (.cse10 (<= .cse20 ~MPR1~0)) (.cse17 (= ~NP~0 |old(~s~0)|)) (.cse7 (<= 1 ~NP~0)) (.cse13 (<= ~MPR3~0 6))) (let ((.cse4 (and (and (and (and .cse6 (and .cse15 .cse22 .cse8 .cse16 .cse12) .cse10 .cse17) .cse7) .cse13) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse5 (and .cse6 .cse22 .cse16 .cse8 .cse12 .cse9 .cse10 .cse11 .cse14)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse18) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse19) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse20) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse21) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and .cse6 .cse15 (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse8 .cse16 .cse12 .cse10 .cse17 .cse14)) (.cse3 (and .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~customIrp~0) .cse11 .cse12 (<= ~NP~0 1) .cse13 (= |old(~customIrp~0)| ~customIrp~0) (not (= |old(~s~0)| ~MPR3~0)) .cse14 (<= 6 ~MPR3~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse4 .cse5 .cse0 .cse1 .cse2 .cse3))))) [2018-12-01 15:03:43,479 INFO L444 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (let ((.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)))) (let ((.cse0 (and (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) .cse4 .cse5)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (not (= 259 FloppyPnp_~ntStatus~0)) .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3)))) [2018-12-01 15:03:43,479 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 333) no Hoare annotation was computed. [2018-12-01 15:03:43,479 INFO L444 ceAbstractionStarter]: At program point L222(lines 218 425) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse6 ~SKIP2~0) (= 0 ~myStatus~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,479 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 385) no Hoare annotation was computed. [2018-12-01 15:03:43,479 INFO L444 ceAbstractionStarter]: At program point L313(line 313) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse5 (= |old(~s~0)| ~NP~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not .cse5) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse5 (<= .cse6 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse7 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,479 INFO L448 ceAbstractionStarter]: For program point L313-1(line 313) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L444 ceAbstractionStarter]: At program point L338(line 338) the Hoare annotation is: (let ((.cse5 (+ ~DC~0 2)) (.cse4 (+ ~SKIP1~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse4) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse3) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (= ~s~0 1) (<= .cse4 ~MPR1~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse5 ~SKIP2~0) (= 0 ~myStatus~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~s~0 2) ~SKIP1~0) (<= 6 ~MPR3~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L338-1(line 338) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L444 ceAbstractionStarter]: At program point L264(lines 264 265) the Hoare annotation is: (let ((.cse0 (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L297-1(lines 231 419) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 162 435) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 426) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L444 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse5 (= |old(~s~0)| ~NP~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not .cse5) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse5 (<= .cse6 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse7 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L372-1(line 372) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 279) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L430-2(lines 430 432) no Hoare annotation was computed. [2018-12-01 15:03:43,480 INFO L444 ceAbstractionStarter]: At program point L323(line 323) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,480 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 423) no Hoare annotation was computed. [2018-12-01 15:03:43,481 INFO L444 ceAbstractionStarter]: At program point L216(lines 212 427) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,481 INFO L444 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-01 15:03:43,481 INFO L448 ceAbstractionStarter]: For program point L307-1(lines 303 309) no Hoare annotation was computed. [2018-12-01 15:03:43,481 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 162 435) no Hoare annotation was computed. [2018-12-01 15:03:43,481 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 208) no Hoare annotation was computed. [2018-12-01 15:03:43,481 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 162 435) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse2 .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5)) (or (not (= |old(~myStatus~0)| 0)) (and .cse2 .cse3 .cse4 (= 0 ~myStatus~0) .cse5) .cse0 .cse1))) [2018-12-01 15:03:43,481 INFO L444 ceAbstractionStarter]: At program point L291(line 291) the Hoare annotation is: (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,481 INFO L444 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,481 INFO L444 ceAbstractionStarter]: At program point L795(line 795) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-01 15:03:43,481 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 669 808) no Hoare annotation was computed. [2018-12-01 15:03:43,481 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2018-12-01 15:03:43,481 INFO L444 ceAbstractionStarter]: At program point L771(line 771) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-01 15:03:43,482 INFO L444 ceAbstractionStarter]: At program point L780(lines 767 800) the Hoare annotation is: (let ((.cse8 (= ~DC~0 ~s~0)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= ~compRegistered~0 0))) (let ((.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (or (and .cse8 .cse4 .cse3 .cse5) (and .cse0 .cse3 .cse4 .cse5 .cse6)))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse0 .cse1 .cse2 (<= ~SKIP2~0 ~s~0) (and .cse3 .cse4 .cse5 .cse6)) (not (= |old(~compRegistered~0)| 0)) (and (and (<= ~MPR3~0 6) (and .cse1 (<= 1 ~NP~0) .cse2 .cse7)) (not (= 259 main_~status~1))) (and .cse1 (<= (+ main_~status~1 1073741823) 0) .cse2 .cse7) (and .cse7 (= 0 main_~status~1)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse8 .cse4 .cse3 .cse5 (<= (+ main_~status~1 1073741738) 0)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)))) [2018-12-01 15:03:43,482 INFO L448 ceAbstractionStarter]: For program point L739(line 739) no Hoare annotation was computed. [2018-12-01 15:03:43,482 INFO L444 ceAbstractionStarter]: At program point L764(lines 757 803) the Hoare annotation is: (let ((.cse4 (= ~SKIP2~0 ~s~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= 0 main_~status~1)) (.cse6 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse7 .cse1 .cse2 .cse3 (<= (+ main_~status~1 1073741738) 0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse6) (and (and (<= ~MPR3~0 6) (and .cse8 (<= 1 ~NP~0) (and .cse7 .cse1 .cse2 .cse3) .cse9)) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ~IPC~0 ~s~0) .cse6) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-01 15:03:43,482 INFO L444 ceAbstractionStarter]: At program point L789(line 789) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-01 15:03:43,482 INFO L444 ceAbstractionStarter]: At program point L756(lines 749 804) the Hoare annotation is: (let ((.cse6 (= 0 main_~status~1)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse11 (<= ~MPR3~0 6)) (.cse10 (<= 1 ~NP~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse12 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= ~IPC~0 ~s~0) .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse8 .cse10 .cse1 .cse5 .cse9 .cse4 (<= ~NP~0 1) .cse11 (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0) .cse7) (and (and .cse11 (and .cse8 .cse10 .cse9 (and .cse12 .cse1 .cse2 .cse3 .cse4))) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse8 .cse12 .cse1 .cse3 .cse4 (<= (+ main_~status~1 1073741823) 0) .cse9 .cse7) (and .cse12 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~1 1073741738) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-01 15:03:43,482 INFO L448 ceAbstractionStarter]: For program point L723(lines 709 748) no Hoare annotation was computed. [2018-12-01 15:03:43,482 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 669 808) no Hoare annotation was computed. [2018-12-01 15:03:43,482 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 736 746) no Hoare annotation was computed. [2018-12-01 15:03:43,482 INFO L444 ceAbstractionStarter]: At program point L707(line 707) the Hoare annotation is: (or (and (= main_~status~1 ~lowerDriverReturn~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 main_~status~1) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-01 15:03:43,482 INFO L448 ceAbstractionStarter]: For program point L707-1(lines 703 807) no Hoare annotation was computed. [2018-12-01 15:03:43,482 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 736 746) no Hoare annotation was computed. [2018-12-01 15:03:43,483 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 669 808) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~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) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-01 15:03:43,483 INFO L448 ceAbstractionStarter]: For program point L765(lines 749 804) no Hoare annotation was computed. [2018-12-01 15:03:43,483 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 747) no Hoare annotation was computed. [2018-12-01 15:03:43,483 INFO L448 ceAbstractionStarter]: For program point L782(lines 782 784) no Hoare annotation was computed. [2018-12-01 15:03:43,483 INFO L448 ceAbstractionStarter]: For program point L766(lines 766 801) no Hoare annotation was computed. [2018-12-01 15:03:43,483 INFO L444 ceAbstractionStarter]: At program point L733(lines 732 747) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (<= ~MPR3~0 6)) (.cse9 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= 6 ~MPR3~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~s~0 ~NP~0) .cse7 (<= ~NP~0 1) .cse8 (<= (+ ~myStatus~0 1073741637) 0) .cse9 .cse10 .cse11) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse8 .cse9 .cse11 .cse0 (= ~s~0 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse10) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-01 15:03:43,483 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2018-12-01 15:03:43,483 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 754) no Hoare annotation was computed. [2018-12-01 15:03:43,484 INFO L444 ceAbstractionStarter]: At program point L709(lines 703 807) the Hoare annotation is: (let ((.cse11 (<= 1 ~NP~0)) (.cse12 (<= ~MPR3~0 6)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (= 0 ~pended~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse5 (= 0 main_~status~1)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~DC~0 ~s~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6) (not (= |old(~compRegistered~0)| 0)) (and .cse7 .cse1 .cse3 .cse2 .cse4 (<= (+ main_~status~1 1073741738) 0)) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse11 .cse3 .cse9 .cse10 .cse4 (<= ~NP~0 1) .cse12 (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0) .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (and (and .cse8 .cse11 (and .cse7 .cse1 .cse3 .cse2 .cse4) .cse10) .cse12) (not (= 259 main_~status~1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse8 .cse7 .cse3 .cse2 .cse4 (<= (+ main_~status~1 1073741823) 0) .cse10 .cse6) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-01 15:03:43,484 INFO L448 ceAbstractionStarter]: For program point L767(lines 767 800) no Hoare annotation was computed. [2018-12-01 15:03:43,484 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 721) no Hoare annotation was computed. [2018-12-01 15:03:43,484 INFO L444 ceAbstractionStarter]: At program point L718-2(lines 718 721) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (<= ~MPR3~0 6)) (.cse9 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= 6 ~MPR3~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~s~0 ~NP~0) .cse7 (<= ~NP~0 1) .cse8 (<= (+ ~myStatus~0 1073741637) 0) .cse9 .cse10 .cse11) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse8 .cse9 .cse11 .cse0 (= ~s~0 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse10) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-01 15:03:43,484 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 778) no Hoare annotation was computed. [2018-12-01 15:03:43,484 INFO L444 ceAbstractionStarter]: At program point L735(lines 734 747) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-01 15:03:43,484 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2018-12-01 15:03:43,484 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 775) no Hoare annotation was computed. [2018-12-01 15:03:43,484 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 798) no Hoare annotation was computed. [2018-12-01 15:03:43,485 INFO L444 ceAbstractionStarter]: At program point L929(line 929) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 1 |old(~s~0)|)) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-12-01 15:03:43,485 INFO L448 ceAbstractionStarter]: For program point L929-1(lines 921 934) no Hoare annotation was computed. [2018-12-01 15:03:43,485 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 921 934) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 1 |old(~s~0)|)) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 (= ~s~0 |old(~s~0)|)) (or .cse0 (not (= ~myStatus~0 0)) .cse1 (= |old(~s~0)| ~s~0)))) [2018-12-01 15:03:43,485 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 921 934) no Hoare annotation was computed. [2018-12-01 15:03:43,485 INFO L451 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: true [2018-12-01 15:03:43,485 INFO L448 ceAbstractionStarter]: For program point L609-1(line 609) no Hoare annotation was computed. [2018-12-01 15:03:43,485 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 604 613) the Hoare annotation is: true [2018-12-01 15:03:43,485 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 604 613) no Hoare annotation was computed. [2018-12-01 15:03:43,485 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 604 613) no Hoare annotation was computed. [2018-12-01 15:03:43,486 INFO L448 ceAbstractionStarter]: For program point L1057(lines 1057 1069) no Hoare annotation was computed. [2018-12-01 15:03:43,486 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1030 1071) no Hoare annotation was computed. [2018-12-01 15:03:43,486 INFO L444 ceAbstractionStarter]: At program point L1043(lines 1035 1054) the Hoare annotation is: (let ((.cse17 (not (= 0 ~pended~0))) (.cse18 (< ~compRegistered~0 1)) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse22 (< ~NP~0 1)) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< |old(~setEventCalled~0)| 1)) (.cse23 (< ~MPR3~0 |old(~s~0)|)) (.cse24 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse17 .cse18 .cse7 .cse12)) (.cse25 (< |old(~s~0)| ~MPR3~0)) (.cse19 (< 1 |old(~setEventCalled~0)|))) (let ((.cse14 (< 0 (+ ~myStatus~0 1073741637))) (.cse0 (or .cse5 .cse6 .cse22 .cse11 .cse16 .cse23 .cse24 .cse25 .cse19)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse20 (<= 1 ~setEventCalled~0)) (.cse3 (= ~s~0 1)) (.cse21 (<= ~setEventCalled~0 1)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse15 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse8 (< ~MPR3~0 6)) (.cse9 (not (= 1 |old(~s~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~myStatus~0 0))) (.cse13 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~compRegistered~0 0)) .cse12 .cse13) (or .cse14 .cse2 (or .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse18 .cse12 .cse19) (and .cse3 .cse4 .cse20 .cse21)) (or .cse14 .cse0 .cse2) (or (and .cse4 .cse20 .cse3 .cse21) .cse1 .cse2 (or .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse18 .cse12 .cse13 .cse19)) (or .cse5 .cse6 .cse22 .cse1 .cse11 .cse16 .cse23 .cse24 .cse13 .cse25 .cse19))))) [2018-12-01 15:03:43,486 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1061 1068) no Hoare annotation was computed. [2018-12-01 15:03:43,486 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1061 1068) no Hoare annotation was computed. [2018-12-01 15:03:43,486 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1054) no Hoare annotation was computed. [2018-12-01 15:03:43,487 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1069) the Hoare annotation is: (let ((.cse27 (+ ~DC~0 5)) (.cse30 (+ ~DC~0 2)) (.cse28 (= 0 ~pended~0))) (let ((.cse25 (= ~s~0 1)) (.cse14 (not .cse28)) (.cse15 (< ~compRegistered~0 1)) (.cse8 (< ~SKIP2~0 .cse30)) (.cse16 (< ~IPC~0 .cse27)) (.cse29 (+ ~SKIP1~0 2))) (let ((.cse20 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse21 (< ~NP~0 1)) (.cse12 (< ~MPR1~0 .cse29)) (.cse13 (< |old(~setEventCalled~0)| 1)) (.cse22 (< ~MPR3~0 |old(~s~0)|)) (.cse23 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse14 .cse15 .cse8 .cse16)) (.cse24 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|)) (.cse19 (and (<= .cse27 ~IPC~0) .cse28 .cse25 (<= .cse29 ~MPR1~0) (<= 1 ~compRegistered~0) (<= ~s~0 ~NP~0) (<= .cse30 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse26 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse4 (and .cse19 .cse26)) (.cse1 (< 0 (+ ~myStatus~0 1073741637))) (.cse7 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~MPR3~0 6)) (.cse10 (not (= 1 |old(~s~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse17 (not (= |old(~customIrp~0)| 0))) (.cse0 (and .cse25 .cse26)) (.cse2 (or .cse20 .cse6 .cse21 .cse12 .cse13 .cse22 .cse23 .cse24 .cse18)) (.cse5 (not (= ~myStatus~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or (or .cse4 (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0))) .cse1 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18)) (or .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 (not (= ~compRegistered~0 0)) .cse16 .cse17) (or .cse20 .cse6 .cse21 .cse5 .cse0 .cse12 .cse13 .cse22 .cse23 .cse17 .cse24 .cse18) (or .cse0 .cse2 .cse5 .cse3)))))) [2018-12-01 15:03:43,487 INFO L444 ceAbstractionStarter]: At program point L1058(lines 1057 1069) the Hoare annotation is: (let ((.cse27 (+ ~DC~0 5)) (.cse30 (+ ~DC~0 2)) (.cse28 (= 0 ~pended~0))) (let ((.cse25 (= ~s~0 1)) (.cse14 (not .cse28)) (.cse15 (< ~compRegistered~0 1)) (.cse8 (< ~SKIP2~0 .cse30)) (.cse16 (< ~IPC~0 .cse27)) (.cse29 (+ ~SKIP1~0 2))) (let ((.cse20 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse21 (< ~NP~0 1)) (.cse12 (< ~MPR1~0 .cse29)) (.cse13 (< |old(~setEventCalled~0)| 1)) (.cse22 (< ~MPR3~0 |old(~s~0)|)) (.cse23 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse14 .cse15 .cse8 .cse16)) (.cse24 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|)) (.cse19 (and (<= .cse27 ~IPC~0) .cse28 .cse25 (<= .cse29 ~MPR1~0) (<= 1 ~compRegistered~0) (<= ~s~0 ~NP~0) (<= .cse30 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse26 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse4 (and .cse19 .cse26)) (.cse1 (< 0 (+ ~myStatus~0 1073741637))) (.cse7 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~MPR3~0 6)) (.cse10 (not (= 1 |old(~s~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse17 (not (= |old(~customIrp~0)| 0))) (.cse0 (and .cse25 .cse26)) (.cse2 (or .cse20 .cse6 .cse21 .cse12 .cse13 .cse22 .cse23 .cse24 .cse18)) (.cse5 (not (= ~myStatus~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or (or .cse4 (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0))) .cse1 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18)) (or .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 (not (= ~compRegistered~0 0)) .cse16 .cse17) (or .cse20 .cse6 .cse21 .cse5 .cse0 .cse12 .cse13 .cse22 .cse23 .cse17 .cse24 .cse18) (or .cse0 .cse2 .cse5 .cse3)))))) [2018-12-01 15:03:43,487 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1030 1071) no Hoare annotation was computed. [2018-12-01 15:03:43,487 INFO L444 ceAbstractionStarter]: At program point L1050(line 1050) the Hoare annotation is: (let ((.cse15 (not (= 0 ~pended~0))) (.cse16 (< ~compRegistered~0 1)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< 6 ~MPR3~0)) (.cse18 (< ~NP~0 1)) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (< |old(~setEventCalled~0)| 1)) (.cse19 (< ~MPR3~0 |old(~s~0)|)) (.cse20 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse15 .cse16 .cse5 .cse10)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse17 (< 1 |old(~setEventCalled~0)|))) (let ((.cse12 (< 0 (+ ~myStatus~0 1073741637))) (.cse0 (or .cse3 .cse4 .cse18 .cse9 .cse14 .cse19 .cse20 .cse21 .cse17)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse13 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse6 (< ~MPR3~0 6)) (.cse7 (not (= 1 |old(~s~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~myStatus~0 0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~compRegistered~0 0)) .cse10 .cse11) (or .cse12 .cse2 (or .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16 .cse10 .cse17)) (or .cse12 .cse0 .cse2) (or .cse1 .cse2 (or .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16 .cse10 .cse11 .cse17)) (or .cse3 .cse4 .cse18 .cse1 .cse9 .cse14 .cse19 .cse20 .cse11 .cse21 .cse17))))) [2018-12-01 15:03:43,487 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2018-12-01 15:03:43,487 INFO L448 ceAbstractionStarter]: For program point L1048-1(lines 1035 1054) no Hoare annotation was computed. [2018-12-01 15:03:43,488 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1041) no Hoare annotation was computed. [2018-12-01 15:03:43,488 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1030 1071) the Hoare annotation is: (let ((.cse24 (not (= 0 ~pended~0))) (.cse25 (< ~compRegistered~0 1)) (.cse20 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse26 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse16 (= |old(~customIrp~0)| ~customIrp~0)) (.cse17 (<= 1 ~setEventCalled~0)) (.cse18 (<= ~setEventCalled~0 1)) (.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse7 (< ~NP~0 1)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~MPR3~0 |old(~s~0)|)) (.cse11 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse24 .cse25 .cse20 .cse26)) (.cse13 (< |old(~s~0)| ~MPR3~0)) (.cse14 (< 1 |old(~setEventCalled~0)|))) (let ((.cse1 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14)) (.cse3 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse16 .cse17 .cse18)) (.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse4 (not (= ~myStatus~0 0))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse19 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse15 (= ~s~0 |old(~s~0)|)) (.cse21 (< ~MPR3~0 6)) (.cse22 (not (= 1 |old(~s~0)|))) (.cse23 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse2 .cse3) (or .cse5 .cse6 .cse7 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3) (or (and .cse15 .cse16 .cse17 .cse18) .cse0 .cse2 (or .cse6 .cse19 .cse20 .cse21 .cse22 .cse23 .cse8 .cse9 .cse24 .cse25 .cse26 .cse14)) (or (and .cse16 .cse17 (= ~s~0 1) .cse18) .cse4 .cse2 (or .cse6 .cse19 .cse20 .cse21 .cse22 .cse23 .cse8 .cse9 .cse24 .cse25 .cse26 .cse12 .cse14)) (or .cse5 .cse6 (and .cse15 .cse16) .cse20 .cse21 .cse22 .cse23 .cse8 (not (= ~compRegistered~0 0)) .cse26 .cse12))))) [2018-12-01 15:03:43,488 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1008 1021) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (= ~s~0 1) (or (< 6 ~MPR3~0) (or .cse0 .cse1 .cse2 (< ~compRegistered~0 1) .cse3) (< ~NP~0 1) (< ~MPR3~0 6) .cse4 (< 1 ~NP~0) (not (= 1 |old(~s~0)|)))) (or .cse0 .cse5 .cse6 .cse2 .cse7 .cse4 .cse3 (= |old(~s~0)| ~s~0)) (or .cse5 (= ~s~0 ~NP~0) (or .cse6 .cse7 .cse1) .cse4 .cse3))) [2018-12-01 15:03:43,488 INFO L444 ceAbstractionStarter]: At program point L1016(line 1016) the Hoare annotation is: (let ((.cse1 (not (= 0 ~pended~0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (< 6 ~MPR3~0) (or .cse0 .cse1 .cse2 (< ~compRegistered~0 1) .cse3) (< ~NP~0 1) (< ~MPR3~0 6) .cse4 (< 1 ~NP~0) (not (= 1 |old(~s~0)|))) (or .cse5 (or .cse6 .cse7 .cse1) .cse4 .cse3) (or .cse0 .cse5 .cse6 .cse2 .cse7 .cse4 .cse3))) [2018-12-01 15:03:43,488 INFO L448 ceAbstractionStarter]: For program point L1016-1(lines 1008 1021) no Hoare annotation was computed. [2018-12-01 15:03:43,488 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1008 1021) no Hoare annotation was computed. [2018-12-01 15:03:43,488 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1018) no Hoare annotation was computed. [2018-12-01 15:03:43,488 INFO L448 ceAbstractionStarter]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2018-12-01 15:03:43,488 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 566) no Hoare annotation was computed. [2018-12-01 15:03:43,488 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 504) no Hoare annotation was computed. [2018-12-01 15:03:43,489 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 493 505) no Hoare annotation was computed. [2018-12-01 15:03:43,489 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 436 603) no Hoare annotation was computed. [2018-12-01 15:03:43,489 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 436 603) the Hoare annotation is: (let ((.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4)) (or (not (= |old(~myStatus~0)| 0)) (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4) .cse0 .cse1))) [2018-12-01 15:03:43,489 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 572) no Hoare annotation was computed. [2018-12-01 15:03:43,489 INFO L444 ceAbstractionStarter]: At program point L516(line 516) the Hoare annotation is: (let ((.cse3 (= ~s~0 1)) (.cse10 (< 0 ~MaximumInterfaceType~0)) (.cse11 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse4 (<= 1 ~compRegistered~0)) (.cse8 (<= ~MPR3~0 ~s~0)) (.cse9 (<= ~s~0 ~MPR3~0)) (.cse5 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse6 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (<= 1 ~setEventCalled~0)) (.cse7 (<= ~setEventCalled~0 1))) (and (let ((.cse0 (= 0 ~myStatus~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse8 .cse9 .cse5 .cse0 .cse6 .cse1 .cse2 .cse7) (not (= |old(~myStatus~0)| 0)) .cse10 .cse11)) (let ((.cse12 (= |old(~myStatus~0)| ~myStatus~0))) (or (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse10 .cse11 (and .cse12 .cse4 .cse8 .cse9 .cse5 .cse6 .cse1 .cse2 .cse7))))) [2018-12-01 15:03:43,495 INFO L448 ceAbstractionStarter]: For program point L516-1(line 516) no Hoare annotation was computed. [2018-12-01 15:03:43,495 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 581) no Hoare annotation was computed. [2018-12-01 15:03:43,495 INFO L444 ceAbstractionStarter]: At program point L574-2(lines 574 581) the Hoare annotation is: (let ((.cse0 (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,495 INFO L444 ceAbstractionStarter]: At program point L599(line 599) the Hoare annotation is: (let ((.cse0 (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-12-01 15:03:43,495 INFO L448 ceAbstractionStarter]: For program point L599-1(line 599) no Hoare annotation was computed. [2018-12-01 15:03:43,495 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 543) no Hoare annotation was computed. [2018-12-01 15:03:43,495 INFO L444 ceAbstractionStarter]: At program point L500(line 500) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-01 15:03:43,495 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2018-12-01 15:03:43,495 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 505) no Hoare annotation was computed. [2018-12-01 15:03:43,495 INFO L444 ceAbstractionStarter]: At program point L510(line 510) the Hoare annotation is: (let ((.cse2 (= ~s~0 |old(~s~0)|)) (.cse3 (<= 1 ~compRegistered~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4)) (or (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4) (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-01 15:03:43,500 INFO L448 ceAbstractionStarter]: For program point L510-1(line 510) no Hoare annotation was computed. [2018-12-01 15:03:43,500 INFO L444 ceAbstractionStarter]: At program point L535(line 535) the Hoare annotation is: (let ((.cse0 (and (<= 1 ~compRegistered~0) (= ~s~0 1))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,500 INFO L448 ceAbstractionStarter]: For program point L535-1(line 535) no Hoare annotation was computed. [2018-12-01 15:03:43,500 INFO L444 ceAbstractionStarter]: At program point L560(lines 560 562) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-01 15:03:43,501 INFO L448 ceAbstractionStarter]: For program point L560-1(lines 560 562) no Hoare annotation was computed. [2018-12-01 15:03:43,501 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 436 603) no Hoare annotation was computed. [2018-12-01 15:03:43,501 INFO L444 ceAbstractionStarter]: At program point L552-2(lines 552 568) the Hoare annotation is: (let ((.cse0 (and (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1))) (<= 0 FloppyStartDevice_~InterfaceType~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,501 INFO L444 ceAbstractionStarter]: At program point L569(lines 530 595) the Hoare annotation is: (let ((.cse0 (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-01 15:03:43,501 INFO L444 ceAbstractionStarter]: At program point L528(line 528) the Hoare annotation is: (let ((.cse9 (+ ~DC~0 2)) (.cse10 (+ ~SKIP1~0 2)) (.cse7 (= 0 ~pended~0)) (.cse8 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse9) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse10) (not (= |old(~compRegistered~0)| 0)) (not .cse7) (< ~IPC~0 .cse8) (not (= |old(~customIrp~0)| 0)))) (.cse3 (= |old(~myStatus~0)| ~myStatus~0)) (.cse2 (let ((.cse4 (and .cse7 (<= .cse8 ~IPC~0) (<= .cse9 ~SKIP2~0) (<= .cse10 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse5 (= ~s~0 1)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse4 (<= FloppyStartDevice_~__cil_tmp42~0 259) .cse5 (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse6) (and (and .cse4 (<= 1 ~NP~0) (<= ~NP~0 1) .cse5 (<= ~MPR3~0 6) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0)) (= 0 ~customIrp~0) .cse6))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 (and .cse2 .cse3)) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse3 .cse2))))) [2018-12-01 15:03:43,506 INFO L444 ceAbstractionStarter]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-01 15:03:43,506 INFO L448 ceAbstractionStarter]: For program point L528-1(line 528) no Hoare annotation was computed. [2018-12-01 15:03:43,506 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2018-12-01 15:03:43,506 INFO L448 ceAbstractionStarter]: For program point L553(lines 552 568) no Hoare annotation was computed. [2018-12-01 15:03:43,506 INFO L448 ceAbstractionStarter]: For program point L586-2(lines 586 591) no Hoare annotation was computed. [2018-12-01 15:03:43,506 INFO L444 ceAbstractionStarter]: At program point L545(lines 532 572) the Hoare annotation is: (let ((.cse5 (+ ~DC~0 2)) (.cse6 (+ ~SKIP1~0 2)) (.cse3 (= 0 ~pended~0)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not .cse3) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (and (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~SKIP2~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 1) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)) (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-12-01 15:03:43,506 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 540) no Hoare annotation was computed. [2018-12-01 15:03:43,506 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 546 549) no Hoare annotation was computed. [2018-12-01 15:03:43,506 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 595) no Hoare annotation was computed. [2018-12-01 15:03:43,507 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 595) no Hoare annotation was computed. [2018-12-01 15:03:43,507 INFO L444 ceAbstractionStarter]: At program point L588(lines 588 589) the Hoare annotation is: (let ((.cse0 (and (not (= 259 FloppyStartDevice_~ntStatus~1)) (and (<= 1 ~compRegistered~0) (= ~s~0 1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-01 15:03:43,509 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 588 589) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 519) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L451 ceAbstractionStarter]: At program point L1104(lines 1103 1113) the Hoare annotation is: true [2018-12-01 15:03:43,510 INFO L451 ceAbstractionStarter]: At program point L1102(lines 1101 1113) the Hoare annotation is: true [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1094 1115) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point L1101(lines 1101 1113) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1105 1112) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1094 1115) the Hoare annotation is: true [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1105 1112) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1094 1115) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1072 1093) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1072 1093) the Hoare annotation is: true [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1072 1093) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L451 ceAbstractionStarter]: At program point L1082(lines 1081 1091) the Hoare annotation is: true [2018-12-01 15:03:43,510 INFO L451 ceAbstractionStarter]: At program point L1080(lines 1079 1091) the Hoare annotation is: true [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1091) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1083 1090) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1083 1090) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 809 833) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 809 833) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L451 ceAbstractionStarter]: At program point L822(lines 821 831) the Hoare annotation is: true [2018-12-01 15:03:43,510 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 823 830) no Hoare annotation was computed. [2018-12-01 15:03:43,510 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 809 833) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 ~s~0))))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2))) [2018-12-01 15:03:43,512 INFO L451 ceAbstractionStarter]: At program point L820(lines 819 831) the Hoare annotation is: true [2018-12-01 15:03:43,512 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 831) no Hoare annotation was computed. [2018-12-01 15:03:43,512 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 823 830) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1022 1029) the Hoare annotation is: true [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1022 1029) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1022 1029) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 656 668) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 656 668) the Hoare annotation is: (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2) (or (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse0))) [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 656 668) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 60 67) the Hoare annotation is: true [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 60 67) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 60 67) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 64) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1003) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L448 ceAbstractionStarter]: For program point L949(lines 949 953) no Hoare annotation was computed. [2018-12-01 15:03:43,513 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 935 1007) the Hoare annotation is: (let ((.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (< ~NP~0 1)) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (< 1 ~NP~0))) (let ((.cse3 (< 6 ~MPR3~0)) (.cse5 (or (or .cse8 .cse14 .cse9 (< ~compRegistered~0 1) .cse12) .cse15 .cse11 .cse16 (not (= 1 |old(~s~0)|)))) (.cse6 (< ~MPR3~0 6))) (let ((.cse0 (or .cse3 .cse5 .cse6)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse4 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse10 (= ~s~0 ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~customIrp~0 0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse2 .cse7) (or .cse8 (< ~MPR3~0 (+ ~NP~0 5)) .cse9 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12 (or .cse13 .cse14)) (or .cse0 .cse2 .cse4 .cse1) (or .cse8 .cse3 .cse15 .cse10 .cse11 .cse6 .cse16 (< ~SKIP1~0 |old(~s~0)|) .cse9 (< |old(~s~0)| ~SKIP1~0) .cse13 .cse12 .cse7))))) [2018-12-01 15:03:43,516 INFO L444 ceAbstractionStarter]: At program point L978(lines 942 1006) the Hoare annotation is: (let ((.cse41 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse37 (+ ~DC~0 2)) (.cse39 (+ ~DC~0 5)) (.cse38 (+ ~SKIP1~0 2)) (.cse31 (= 0 ~pended~0)) (.cse40 (+ ~NP~0 2))) (let ((.cse17 (< ~SKIP1~0 .cse40)) (.cse28 (not .cse31)) (.cse23 (< ~MPR1~0 .cse38)) (.cse26 (< ~IPC~0 .cse39)) (.cse18 (< ~NP~0 1)) (.cse19 (< ~SKIP2~0 .cse37)) (.cse20 (< 1 ~NP~0)) (.cse6 (= ~MPR1~0 ~s~0)) (.cse7 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse41) 3221225494))) (.cse8 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse9 (<= (+ .cse41 1) 0)) (.cse27 (+ ~NP~0 5))) (let ((.cse10 (= IofCallDriver_~returnVal2~0 259)) (.cse15 (let ((.cse29 (<= .cse40 ~SKIP1~0)) (.cse30 (<= .cse39 ~IPC~0)) (.cse32 (<= .cse38 ~MPR1~0)) (.cse33 (<= 1 ~compRegistered~0)) (.cse34 (<= .cse27 ~MPR3~0)) (.cse35 (<= .cse37 ~SKIP2~0)) (.cse36 (= ~NP~0 |old(~s~0)|))) (or (and .cse29 .cse30 .cse31 .cse32 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse33 .cse34 .cse6 .cse35 .cse7 .cse8 .cse9 .cse36) (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse6 .cse35 .cse7 (= 0 IofCallDriver_~returnVal2~0) .cse8 .cse9 .cse36)))) (.cse11 (<= 1 ~setEventCalled~0)) (.cse12 (<= ~setEventCalled~0 1)) (.cse5 (< 6 ~MPR3~0)) (.cse13 (or (or .cse17 .cse28 .cse23 (< ~compRegistered~0 1) .cse26) .cse18 .cse19 .cse20 (not (= 1 |old(~s~0)|)))) (.cse14 (< ~MPR3~0 6))) (let ((.cse0 (or .cse5 .cse13 .cse14)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (<= 1 ~NP~0) .cse15 (<= ~MPR3~0 6) .cse11 .cse12) (<= ~MaximumInterfaceType~0 0))) (.cse3 (and .cse9 .cse11 .cse10 .cse6 .cse7 .cse8 .cse12)) (.cse4 (not (= ~myStatus~0 0))) (.cse16 (not (= ~customIrp~0 0))) (.cse21 (= ~s~0 ~SKIP1~0)) (.cse22 (< ~SKIP1~0 |old(~s~0)|)) (.cse24 (< |old(~s~0)| ~SKIP1~0)) (.cse25 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2 .cse3) (or .cse0 .cse4 .cse2 .cse1 .cse3) (or .cse5 .cse4 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 (and .cse15 .cse11 .cse12) .cse16) (or .cse17 .cse5 .cse18 .cse19 .cse14 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse16) (or .cse17 (< ~MPR3~0 .cse27) .cse21 .cse19 .cse22 .cse23 .cse24 .cse26 (or .cse25 .cse28))))))) [2018-12-01 15:03:43,516 INFO L444 ceAbstractionStarter]: At program point L945(line 945) the Hoare annotation is: (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse14 (< ~NP~0 1)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (< 1 ~NP~0))) (let ((.cse9 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse8 .cse4 (< ~compRegistered~0 1) .cse6) .cse14 .cse5 .cse15 (not (= 1 |old(~s~0)|)))) (.cse12 (< ~MPR3~0 6))) (let ((.cse7 (not (= ~compRegistered~0 0))) (.cse13 (not (= ~customIrp~0 0))) (.cse0 (or .cse9 .cse11 .cse12)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse10 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse3 (< ~MPR3~0 (+ ~NP~0 5)) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6 (or .cse7 .cse8)) (or .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (or .cse3 .cse9 .cse14 .cse5 .cse12 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse4 (< |old(~s~0)| ~SKIP1~0) .cse7 .cse6 .cse13) (or .cse0 .cse2 .cse10 .cse1))))) [2018-12-01 15:03:43,521 INFO L448 ceAbstractionStarter]: For program point L945-1(line 945) no Hoare annotation was computed. [2018-12-01 15:03:43,521 INFO L444 ceAbstractionStarter]: At program point L966(lines 965 980) the Hoare annotation is: (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (not (= 0 ~pended~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse12 (< ~NP~0 1)) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (< 1 ~NP~0))) (let ((.cse11 (< 6 ~MPR3~0)) (.cse16 (or (or .cse3 .cse9 .cse4 (< ~compRegistered~0 1) .cse7) .cse12 .cse6 .cse14 (not (= 1 |old(~s~0)|)))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (or .cse11 .cse16 .cse13)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse5 (= ~s~0 ~SKIP1~0)) (.cse8 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~myStatus~0 0))) (.cse1 (let ((.cse17 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse17 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse15 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse3 (< ~MPR3~0 (+ ~NP~0 5)) .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 (or .cse8 .cse9)) (or .cse0 .cse10 .cse2 .cse1) (or .cse3 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14 (< ~SKIP1~0 |old(~s~0)|) .cse4 (< |old(~s~0)| ~SKIP1~0) .cse8 .cse7 .cse15) (or .cse11 .cse10 .cse16 .cse13 .cse1 .cse15))))) [2018-12-01 15:03:43,521 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1002) no Hoare annotation was computed. [2018-12-01 15:03:43,521 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 935 1007) no Hoare annotation was computed. [2018-12-01 15:03:43,521 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 981) no Hoare annotation was computed. [2018-12-01 15:03:43,521 INFO L448 ceAbstractionStarter]: For program point L987(lines 987 993) no Hoare annotation was computed. [2018-12-01 15:03:43,521 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 935 1007) no Hoare annotation was computed. [2018-12-01 15:03:43,521 INFO L444 ceAbstractionStarter]: At program point L1000(line 1000) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse13 (< ~NP~0 1)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (< 1 ~NP~0))) (let ((.cse8 (< 6 ~MPR3~0)) (.cse10 (or (or .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5) .cse13 .cse4 .cse14 (not (= 1 |old(~s~0)|)))) (.cse11 (< ~MPR3~0 6))) (let ((.cse6 (not (= ~compRegistered~0 0))) (.cse12 (not (= ~customIrp~0 0))) (.cse0 (or .cse8 .cse10 .cse11)) (.cse9 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1) (or .cse2 (< ~MPR3~0 (+ ~NP~0 5)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5 (or .cse6 .cse7)) (or .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse2 .cse8 .cse13 .cse4 .cse11 .cse14 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse6 .cse5 .cse12) (or .cse0 .cse9 .cse1))))) [2018-12-01 15:03:43,525 INFO L448 ceAbstractionStarter]: For program point L1000-1(lines 982 1004) no Hoare annotation was computed. [2018-12-01 15:03:43,526 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 980) no Hoare annotation was computed. [2018-12-01 15:03:43,526 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 967 979) no Hoare annotation was computed. [2018-12-01 15:03:43,526 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 967 979) no Hoare annotation was computed. [2018-12-01 15:03:43,526 INFO L444 ceAbstractionStarter]: At program point L959(lines 958 981) the Hoare annotation is: (let ((.cse27 (+ ~DC~0 2)) (.cse24 (+ ~DC~0 5)) (.cse26 (+ ~SKIP1~0 2)) (.cse25 (= 0 ~pended~0)) (.cse23 (+ ~NP~0 2))) (let ((.cse14 (< ~SKIP1~0 .cse23)) (.cse20 (not .cse25)) (.cse15 (< ~MPR1~0 .cse26)) (.cse18 (< ~IPC~0 .cse24)) (.cse21 (< ~NP~0 1)) (.cse17 (< ~SKIP2~0 .cse27)) (.cse22 (< 1 ~NP~0)) (.cse28 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse28) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse8 (<= (+ .cse28 1) 0)) (.cse9 (<= 1 ~setEventCalled~0)) (.cse10 (<= ~setEventCalled~0 1)) (.cse4 (< 6 ~MPR3~0)) (.cse11 (or (or .cse14 .cse20 .cse15 (< ~compRegistered~0 1) .cse18) .cse21 .cse17 .cse22 (not (= 1 |old(~s~0)|)))) (.cse12 (< ~MPR3~0 6))) (let ((.cse0 (or .cse4 .cse11 .cse12)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse23 ~SKIP1~0) (<= 1 ~NP~0) (<= .cse24 ~IPC~0) .cse25 (<= .cse26 ~MPR1~0) (<= 1 ~compRegistered~0) .cse5 (<= .cse27 ~SKIP2~0) .cse6 (<= ~NP~0 1) .cse7 .cse8 (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) .cse9 (<= ~MaximumInterfaceType~0 0) .cse10 (<= 6 ~MPR3~0))) (.cse3 (not (= ~myStatus~0 0))) (.cse16 (= ~s~0 ~SKIP1~0)) (.cse19 (not (= ~compRegistered~0 0))) (.cse13 (not (= ~customIrp~0 0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse2) (or .cse4 .cse3 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse14 (< ~MPR3~0 (+ ~NP~0 5)) .cse15 .cse16 (not (= ~SKIP1~0 |old(~s~0)|)) .cse17 .cse18 (or .cse19 .cse20)) (or .cse14 .cse4 .cse21 .cse16 .cse17 .cse12 .cse22 (< ~SKIP1~0 |old(~s~0)|) .cse15 (< |old(~s~0)| ~SKIP1~0) .cse19 .cse18 .cse13)))))) [2018-12-01 15:03:43,526 INFO L444 ceAbstractionStarter]: At program point L951(line 951) the Hoare annotation is: (let ((.cse20 (+ ~DC~0 2)) (.cse18 (+ ~DC~0 5)) (.cse19 (+ ~SKIP1~0 2)) (.cse17 (= 0 ~pended~0))) (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (not .cse17)) (.cse5 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse12 (< ~NP~0 1)) (.cse6 (< ~SKIP2~0 .cse20)) (.cse14 (< 1 ~NP~0))) (let ((.cse4 (+ ~NP~0 5)) (.cse11 (< 6 ~MPR3~0)) (.cse16 (or (or .cse3 .cse9 .cse5 (< ~compRegistered~0 1) .cse7) .cse12 .cse6 .cse14 (not (= 1 |old(~s~0)|)))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (or .cse11 .cse16 .cse13)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse8 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~myStatus~0 0))) (.cse2 (and (<= 1 ~setEventCalled~0) (let ((.cse21 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse17 (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0) (<= .cse4 ~MPR3~0) (<= .cse20 ~SKIP2~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse21 1) 0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0))) (<= ~setEventCalled~0 1))) (.cse15 (not (= ~customIrp~0 0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse3 (< ~MPR3~0 .cse4) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 (or .cse8 .cse9)) (or .cse0 .cse10 .cse1 .cse2) (or .cse3 .cse11 .cse12 .cse6 .cse13 .cse14 (< ~SKIP1~0 |old(~s~0)|) .cse5 (< |old(~s~0)| ~SKIP1~0) .cse8 .cse7 .cse15) (or .cse11 .cse10 .cse2 .cse16 .cse13 .cse15)))))) [2018-12-01 15:03:43,528 INFO L448 ceAbstractionStarter]: For program point L943(lines 943 955) no Hoare annotation was computed. [2018-12-01 15:03:43,528 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 943 955) no Hoare annotation was computed. [2018-12-01 15:03:43,528 INFO L444 ceAbstractionStarter]: At program point L964(lines 963 980) the Hoare annotation is: (let ((.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (< ~NP~0 1)) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (< 1 ~NP~0))) (let ((.cse3 (< 6 ~MPR3~0)) (.cse5 (or (or .cse8 .cse14 .cse9 (< ~compRegistered~0 1) .cse12) .cse15 .cse11 .cse16 (not (= 1 |old(~s~0)|)))) (.cse6 (< ~MPR3~0 6))) (let ((.cse0 (or .cse3 .cse5 .cse6)) (.cse4 (not (= ~myStatus~0 0))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (let ((.cse17 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse17 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse10 (= ~s~0 ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse3 .cse4 .cse1 .cse5 .cse6 .cse7) (or .cse8 (< ~MPR3~0 (+ ~NP~0 5)) .cse9 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12 (or .cse13 .cse14)) (or .cse0 .cse4 .cse2 .cse1) (or .cse8 .cse3 .cse15 .cse10 .cse11 .cse6 .cse16 (< ~SKIP1~0 |old(~s~0)|) .cse9 (< |old(~s~0)| ~SKIP1~0) .cse13 .cse12 .cse7))))) [2018-12-01 15:03:43,528 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 150) no Hoare annotation was computed. [2018-12-01 15:03:43,528 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 112 160) no Hoare annotation was computed. [2018-12-01 15:03:43,528 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 99 161) no Hoare annotation was computed. [2018-12-01 15:03:43,529 INFO L444 ceAbstractionStarter]: At program point L143(line 143) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-12-01 15:03:43,529 INFO L448 ceAbstractionStarter]: For program point L143-1(line 143) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L444 ceAbstractionStarter]: At program point L141(lines 141 142) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 141 142) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 138) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 99 161) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 128) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 99 161) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L444 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 125) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 152 158) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 123 125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 118) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 136) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point L134-2(lines 134 136) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-01 15:03:43,532 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-12-01 15:03:43,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 15:03:43,533 INFO L444 ceAbstractionStarter]: At program point L641(line 641) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse6 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) (.cse1 (<= ~MPR3~0 ~s~0)) (.cse2 (<= ~s~0 ~MPR3~0)) (.cse3 (<= 1 ~setEventCalled~0)) (.cse5 (<= ~setEventCalled~0 1)) (.cse4 (= 259 FlFdcDeviceIo_~__cil_tmp11~0))) (and (or (not (= ~myStatus~0 0)) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (= ~s~0 1) .cse3 .cse4 .cse5) (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse6 (and (and .cse1 .cse2 .cse3 .cse5) .cse4)))) [2018-12-01 15:03:43,536 INFO L448 ceAbstractionStarter]: For program point L641-1(line 641) no Hoare annotation was computed. [2018-12-01 15:03:43,536 INFO L448 ceAbstractionStarter]: For program point L639(lines 639 644) no Hoare annotation was computed. [2018-12-01 15:03:43,536 INFO L448 ceAbstractionStarter]: For program point L639-2(lines 639 644) no Hoare annotation was computed. [2018-12-01 15:03:43,536 INFO L444 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) (.cse2 (= ~s~0 |old(~s~0)|))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2))) [2018-12-01 15:03:43,536 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 614 648) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2))) [2018-12-01 15:03:43,536 INFO L448 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2018-12-01 15:03:43,537 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 614 648) no Hoare annotation was computed. [2018-12-01 15:03:43,537 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2018-12-01 15:03:43,537 INFO L444 ceAbstractionStarter]: At program point L626(lines 626 627) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2))) [2018-12-01 15:03:43,537 INFO L448 ceAbstractionStarter]: For program point L626-1(lines 626 627) no Hoare annotation was computed. [2018-12-01 15:03:43,537 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 614 648) no Hoare annotation was computed. [2018-12-01 15:03:43,537 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 92 98) no Hoare annotation was computed. [2018-12-01 15:03:43,537 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 92 98) the Hoare annotation is: true [2018-12-01 15:03:43,537 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 92 98) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 15:03:43,542 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) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (<= ~MaximumInterfaceType~0 0)) [2018-12-01 15:03:43,542 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L451 ceAbstractionStarter]: At program point L864(lines 863 875) the Hoare annotation is: true [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 875) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 855 877) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 867 874) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 855 877) the Hoare annotation is: true [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 855 877) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L451 ceAbstractionStarter]: At program point L866(lines 865 875) the Hoare annotation is: true [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 867 874) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 834 854) the Hoare annotation is: true [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 834 854) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L451 ceAbstractionStarter]: At program point L843(lines 842 852) the Hoare annotation is: true [2018-12-01 15:03:43,542 INFO L451 ceAbstractionStarter]: At program point L841(lines 840 852) the Hoare annotation is: true [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 852) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 834 854) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 844 851) no Hoare annotation was computed. [2018-12-01 15:03:43,542 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 844 851) no Hoare annotation was computed. [2018-12-01 15:03:43,543 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1116 1136) the Hoare annotation is: true [2018-12-01 15:03:43,543 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1116 1136) no Hoare annotation was computed. [2018-12-01 15:03:43,543 INFO L451 ceAbstractionStarter]: At program point L1125(lines 1124 1134) the Hoare annotation is: true [2018-12-01 15:03:43,543 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1126 1133) no Hoare annotation was computed. [2018-12-01 15:03:43,543 INFO L451 ceAbstractionStarter]: At program point L1123(lines 1122 1134) the Hoare annotation is: true [2018-12-01 15:03:43,543 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1116 1136) no Hoare annotation was computed. [2018-12-01 15:03:43,543 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1134) no Hoare annotation was computed. [2018-12-01 15:03:43,546 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1126 1133) no Hoare annotation was computed. [2018-12-01 15:03:43,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:03:43 BoogieIcfgContainer [2018-12-01 15:03:43,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 15:03:43,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:03:43,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:03:43,597 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:03:43,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:03:15" (3/4) ... [2018-12-01 15:03:43,600 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-01 15:03:43,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-12-01 15:03:43,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-12-01 15:03:43,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-12-01 15:03:43,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-12-01 15:03:43,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-01 15:03:43,621 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2018-12-01 15:03:43,622 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2018-12-01 15:03:43,623 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-01 15:03:43,625 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 15:03:43,651 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || (((((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((NP + 2 <= SKIP1 && 1 <= NP) && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-01 15:03:43,651 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-01 15:03:43,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-01 15:03:43,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || ((((status == lowerDriverReturn && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && SKIP2 <= s) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0))) && !(259 == status))) || (((NP + 2 <= SKIP1 && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)))) || (((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-01 15:03:43,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) && ((((((0 < \old(myStatus) + 1073741637 || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) [2018-12-01 15:03:43,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) [2018-12-01 15:03:43,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) [2018-12-01 15:03:43,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-01 15:03:43,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-01 15:03:43,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3)) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) [2018-12-01 15:03:43,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((6 < MPR3 || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || s == SKIP1) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended)) [2018-12-01 15:03:43,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((((((((((s == 1 && \old(customIrp) == customIrp) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled)) || (((s == 1 && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((0 < myStatus + 1073741637 || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && s == 1) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) [2018-12-01 15:03:43,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) [2018-12-01 15:03:43,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0)) [2018-12-01 15:03:43,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) [2018-12-01 15:03:43,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-01 15:03:43,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-01 15:03:43,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus)) && ((((((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-01 15:03:43,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) [2018-12-01 15:03:43,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) [2018-12-01 15:03:43,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) [2018-12-01 15:03:43,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) [2018-12-01 15:03:43,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) [2018-12-01 15:03:43,717 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_11905f50-d789-44a7-956e-b03ce301d392/bin-2019/uautomizer/witness.graphml [2018-12-01 15:03:43,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:03:43,718 INFO L168 Benchmark]: Toolchain (without parser) took 28683.06 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 719.8 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -225.3 MB). Peak memory consumption was 494.6 MB. Max. memory is 11.5 GB. [2018-12-01 15:03:43,718 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:03:43,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-01 15:03:43,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:03:43,719 INFO L168 Benchmark]: Boogie Preprocessor took 33.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 15:03:43,719 INFO L168 Benchmark]: RCFGBuilder took 474.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2018-12-01 15:03:43,719 INFO L168 Benchmark]: TraceAbstraction took 27776.24 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 614.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 793.6 MB. Max. memory is 11.5 GB. [2018-12-01 15:03:43,719 INFO L168 Benchmark]: Witness Printer took 120.57 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-12-01 15:03:43,720 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 474.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27776.24 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 614.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 793.6 MB. Max. memory is 11.5 GB. * Witness Printer took 120.57 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 64]: 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: 218]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) - InvariantResult [Line: 887]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((((((((((s == 1 && \old(customIrp) == customIrp) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled)) || (((s == 1 && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((0 < myStatus + 1073741637 || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && s == 1) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 749]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) && ((((((0 < \old(myStatus) + 1073741637 || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) - InvariantResult [Line: 958]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3)) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1103]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0)) - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 734]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus)) && ((((((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) - InvariantResult [Line: 732]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1081]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || (((((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((NP + 2 <= SKIP1 && 1 <= NP) && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) - InvariantResult [Line: 1122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || ((((status == lowerDriverReturn && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && SKIP2 <= s) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0))) && !(259 == status))) || (((NP + 2 <= SKIP1 && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)))) || (((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((6 < MPR3 || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || s == SKIP1) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended)) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 325 locations, 1 error locations. SAFE Result, 27.6s OverallTime, 50 OverallIterations, 2 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 15.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 15906 SDtfs, 8968 SDslu, 49367 SDs, 0 SdLazy, 9474 SolverSat, 1719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 956 GetRequests, 584 SyntacticMatches, 16 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=817occurred in iteration=7, 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: 1.2s AutomataMinimizationTime, 50 MinimizatonAttempts, 1629 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 117 LocationsWithAnnotation, 1959 PreInvPairs, 2220 NumberOfFragments, 17874 HoareAnnotationTreeSize, 1959 FomulaSimplifications, 96833 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 117 FomulaSimplificationsInter, 320493 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 4374 NumberOfCodeBlocks, 4374 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4321 ConstructedInterpolants, 0 QuantifiedInterpolants, 736782 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3716 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 53 InterpolantComputations, 50 PerfectInterpolantSequences, 374/383 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...