./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/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 9187bc92090d01e0892e8fd14c7d6a75e3556b66 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:36:31,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:36:31,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:36:31,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:36:31,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:36:31,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:36:31,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:36:31,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:36:31,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:36:31,569 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:36:31,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:36:31,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:36:31,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:36:31,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:36:31,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:36:31,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:36:31,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:36:31,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:36:31,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:36:31,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:36:31,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:36:31,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:36:31,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:36:31,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:36:31,579 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:36:31,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:36:31,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:36:31,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:36:31,581 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:36:31,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:36:31,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:36:31,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:36:31,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:36:31,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:36:31,583 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:36:31,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:36:31,584 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:36:31,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:36:31,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:36:31,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:36:31,592 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:36:31,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:36:31,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:36:31,593 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:36:31,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:36:31,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:36:31,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:36:31,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:36:31,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:36:31,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:36:31,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:36:31,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:36:31,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:36:31,594 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:36:31,594 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:36:31,594 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:36:31,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:36:31,595 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:36:31,595 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:36:31,595 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:36:31,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:36:31,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:36:31,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:36:31,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:36:31,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:36:31,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:36:31,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:36:31,596 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_a5c2badc-7708-435e-b2e0-88da341a0f1c/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 -> 9187bc92090d01e0892e8fd14c7d6a75e3556b66 [2018-11-23 08:36:31,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:36:31,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:36:31,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:36:31,631 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:36:31,632 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:36:31,632 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 08:36:31,676 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/data/aaf4c2c33/3f9aa12ec8b74b5ebeeed075c61a7d90/FLAGcc6552eb4 [2018-11-23 08:36:32,112 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:36:32,112 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 08:36:32,125 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/data/aaf4c2c33/3f9aa12ec8b74b5ebeeed075c61a7d90/FLAGcc6552eb4 [2018-11-23 08:36:32,136 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/data/aaf4c2c33/3f9aa12ec8b74b5ebeeed075c61a7d90 [2018-11-23 08:36:32,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:36:32,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:36:32,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:32,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:36:32,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:36:32,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16069910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32, skipping insertion in model container [2018-11-23 08:36:32,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:36:32,186 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:36:32,418 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:32,421 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:36:32,546 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:32,558 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:36:32,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32 WrapperNode [2018-11-23 08:36:32,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:32,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:32,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:36:32,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:36:32,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:32,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:36:32,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:36:32,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:36:32,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... [2018-11-23 08:36:32,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:36:32,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:36:32,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:36:32,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:36:32,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:36:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-23 08:36:32,685 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-23 08:36:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 08:36:32,685 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 08:36:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-23 08:36:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-23 08:36:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-23 08:36:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-23 08:36:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:36:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:36:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-23 08:36:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-23 08:36:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 08:36:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 08:36:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-23 08:36:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-23 08:36:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 08:36:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 08:36:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 08:36:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 08:36:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-23 08:36:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-23 08:36:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-23 08:36:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-23 08:36:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-23 08:36:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-23 08:36:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-23 08:36:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-23 08:36:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 08:36:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 08:36:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 08:36:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 08:36:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 08:36:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 08:36:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 08:36:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 08:36:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-23 08:36:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-23 08:36:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-23 08:36:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-23 08:36:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-23 08:36:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-23 08:36:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:36:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:36:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-23 08:36:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-23 08:36:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-23 08:36:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-23 08:36:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-23 08:36:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-23 08:36:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:36:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:36:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-23 08:36:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-23 08:36:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-23 08:36:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-23 08:36:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-23 08:36:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-23 08:36:32,915 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:32,916 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:32,957 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:32,957 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:32,975 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:32,975 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,107 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,108 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,190 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,190 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,253 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,253 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,258 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,258 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,264 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,264 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,285 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,286 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,331 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,331 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,490 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,490 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,496 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,496 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,504 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 08:36:33,504 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 08:36:33,519 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:36:33,519 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 08:36:33,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:33 BoogieIcfgContainer [2018-11-23 08:36:33,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:36:33,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:36:33,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:36:33,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:36:33,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:36:32" (1/3) ... [2018-11-23 08:36:33,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e6d210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:33, skipping insertion in model container [2018-11-23 08:36:33,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:32" (2/3) ... [2018-11-23 08:36:33,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e6d210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:33, skipping insertion in model container [2018-11-23 08:36:33,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:33" (3/3) ... [2018-11-23 08:36:33,526 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 08:36:33,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:36:33,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:36:33,557 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:36:33,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:36:33,585 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:36:33,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:36:33,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:36:33,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:36:33,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:36:33,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:36:33,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:36:33,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:36:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2018-11-23 08:36:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 08:36:33,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:33,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:33,611 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:33,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash -688252531, now seen corresponding path program 1 times [2018-11-23 08:36:33,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:33,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:33,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:33,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:33,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:33,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:33,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:33,799 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2018-11-23 08:36:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:33,890 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2018-11-23 08:36:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:33,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 08:36:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:33,903 INFO L225 Difference]: With dead ends: 624 [2018-11-23 08:36:33,903 INFO L226 Difference]: Without dead ends: 380 [2018-11-23 08:36:33,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-23 08:36:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-23 08:36:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-23 08:36:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2018-11-23 08:36:33,954 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2018-11-23 08:36:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:33,955 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2018-11-23 08:36:33,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2018-11-23 08:36:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:36:33,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:33,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:33,957 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:33,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1177754650, now seen corresponding path program 1 times [2018-11-23 08:36:33,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:33,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:33,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:33,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:33,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:34,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:34,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:34,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:34,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:34,079 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2018-11-23 08:36:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:34,254 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2018-11-23 08:36:34,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:34,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 08:36:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:34,259 INFO L225 Difference]: With dead ends: 699 [2018-11-23 08:36:34,259 INFO L226 Difference]: Without dead ends: 536 [2018-11-23 08:36:34,261 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-11-23 08:36:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-23 08:36:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2018-11-23 08:36:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-11-23 08:36:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2018-11-23 08:36:34,297 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2018-11-23 08:36:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:34,298 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2018-11-23 08:36:34,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2018-11-23 08:36:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 08:36:34,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:34,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:34,300 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:34,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1821616786, now seen corresponding path program 1 times [2018-11-23 08:36:34,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:34,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:34,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:34,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:34,396 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2018-11-23 08:36:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:34,438 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2018-11-23 08:36:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:34,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 08:36:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:34,443 INFO L225 Difference]: With dead ends: 642 [2018-11-23 08:36:34,443 INFO L226 Difference]: Without dead ends: 623 [2018-11-23 08:36:34,443 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-11-23 08:36:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-11-23 08:36:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2018-11-23 08:36:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-23 08:36:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2018-11-23 08:36:34,474 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2018-11-23 08:36:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:34,475 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2018-11-23 08:36:34,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2018-11-23 08:36:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 08:36:34,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:34,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:34,477 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:34,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1105627836, now seen corresponding path program 1 times [2018-11-23 08:36:34,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:34,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:34,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:34,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:34,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:34,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:34,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:34,546 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2018-11-23 08:36:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:34,589 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2018-11-23 08:36:34,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:34,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 08:36:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:34,593 INFO L225 Difference]: With dead ends: 1080 [2018-11-23 08:36:34,593 INFO L226 Difference]: Without dead ends: 788 [2018-11-23 08:36:34,594 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-11-23 08:36:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-11-23 08:36:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2018-11-23 08:36:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-23 08:36:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2018-11-23 08:36:34,621 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2018-11-23 08:36:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:34,622 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2018-11-23 08:36:34,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2018-11-23 08:36:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 08:36:34,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:34,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:34,624 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:34,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash 149710402, now seen corresponding path program 1 times [2018-11-23 08:36:34,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:34,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:34,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:34,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:34,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:34,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:34,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:34,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:34,656 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2018-11-23 08:36:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:34,730 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2018-11-23 08:36:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:34,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 08:36:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:34,733 INFO L225 Difference]: With dead ends: 795 [2018-11-23 08:36:34,733 INFO L226 Difference]: Without dead ends: 790 [2018-11-23 08:36:34,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-11-23 08:36:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2018-11-23 08:36:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-23 08:36:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2018-11-23 08:36:34,755 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2018-11-23 08:36:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:34,756 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2018-11-23 08:36:34,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2018-11-23 08:36:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 08:36:34,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:34,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:34,757 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:34,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1382897701, now seen corresponding path program 1 times [2018-11-23 08:36:34,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:34,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:34,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:34,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:34,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:34,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:34,812 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2018-11-23 08:36:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:34,885 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2018-11-23 08:36:34,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:34,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 08:36:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:34,888 INFO L225 Difference]: With dead ends: 803 [2018-11-23 08:36:34,888 INFO L226 Difference]: Without dead ends: 800 [2018-11-23 08:36:34,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-11-23 08:36:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2018-11-23 08:36:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-11-23 08:36:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2018-11-23 08:36:34,911 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2018-11-23 08:36:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:34,912 INFO L480 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2018-11-23 08:36:34,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2018-11-23 08:36:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 08:36:34,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:34,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:34,913 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:34,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash -91658760, now seen corresponding path program 1 times [2018-11-23 08:36:34,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:34,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:34,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:34,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:34,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:34,949 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2018-11-23 08:36:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:34,987 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2018-11-23 08:36:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:34,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-23 08:36:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:34,990 INFO L225 Difference]: With dead ends: 812 [2018-11-23 08:36:34,990 INFO L226 Difference]: Without dead ends: 797 [2018-11-23 08:36:34,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-23 08:36:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2018-11-23 08:36:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-23 08:36:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2018-11-23 08:36:35,011 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2018-11-23 08:36:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:35,012 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2018-11-23 08:36:35,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2018-11-23 08:36:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 08:36:35,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:35,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:35,013 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:35,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash 797704003, now seen corresponding path program 1 times [2018-11-23 08:36:35,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:35,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:35,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:35,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:35,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:35,057 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2018-11-23 08:36:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:35,093 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2018-11-23 08:36:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:35,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-23 08:36:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:35,098 INFO L225 Difference]: With dead ends: 810 [2018-11-23 08:36:35,098 INFO L226 Difference]: Without dead ends: 790 [2018-11-23 08:36:35,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-11-23 08:36:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-11-23 08:36:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-11-23 08:36:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-11-23 08:36:35,119 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2018-11-23 08:36:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:35,119 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-11-23 08:36:35,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-11-23 08:36:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 08:36:35,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:35,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:35,121 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 354660221, now seen corresponding path program 1 times [2018-11-23 08:36:35,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:35,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:35,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:35,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:35,172 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 5 states. [2018-11-23 08:36:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:35,388 INFO L93 Difference]: Finished difference Result 798 states and 1072 transitions. [2018-11-23 08:36:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:35,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 08:36:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:35,391 INFO L225 Difference]: With dead ends: 798 [2018-11-23 08:36:35,391 INFO L226 Difference]: Without dead ends: 792 [2018-11-23 08:36:35,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-11-23 08:36:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2018-11-23 08:36:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-11-23 08:36:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1065 transitions. [2018-11-23 08:36:35,427 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1065 transitions. Word has length 43 [2018-11-23 08:36:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:35,427 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1065 transitions. [2018-11-23 08:36:35,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1065 transitions. [2018-11-23 08:36:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 08:36:35,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:35,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:35,429 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:35,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 472733380, now seen corresponding path program 1 times [2018-11-23 08:36:35,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:35,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:35,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:35,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:36:35,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:36:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:36:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:36:35,466 INFO L87 Difference]: Start difference. First operand 790 states and 1065 transitions. Second operand 4 states. [2018-11-23 08:36:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:35,507 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2018-11-23 08:36:35,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:36:35,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 08:36:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:35,510 INFO L225 Difference]: With dead ends: 818 [2018-11-23 08:36:35,510 INFO L226 Difference]: Without dead ends: 796 [2018-11-23 08:36:35,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-11-23 08:36:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 792. [2018-11-23 08:36:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-23 08:36:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1067 transitions. [2018-11-23 08:36:35,530 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1067 transitions. Word has length 42 [2018-11-23 08:36:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:35,530 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1067 transitions. [2018-11-23 08:36:35,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:36:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1067 transitions. [2018-11-23 08:36:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 08:36:35,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:35,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:35,531 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:35,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1725637380, now seen corresponding path program 1 times [2018-11-23 08:36:35,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:35,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:35,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:35,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:35,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:35,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:35,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:35,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:35,572 INFO L87 Difference]: Start difference. First operand 792 states and 1067 transitions. Second operand 3 states. [2018-11-23 08:36:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:35,639 INFO L93 Difference]: Finished difference Result 1170 states and 1590 transitions. [2018-11-23 08:36:35,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:35,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-23 08:36:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:35,642 INFO L225 Difference]: With dead ends: 1170 [2018-11-23 08:36:35,642 INFO L226 Difference]: Without dead ends: 1167 [2018-11-23 08:36:35,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-11-23 08:36:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 915. [2018-11-23 08:36:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-11-23 08:36:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2018-11-23 08:36:35,671 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 44 [2018-11-23 08:36:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:35,671 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2018-11-23 08:36:35,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2018-11-23 08:36:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 08:36:35,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:35,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:35,673 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:35,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1543911893, now seen corresponding path program 1 times [2018-11-23 08:36:35,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:35,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:35,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:35,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:35,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:35,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:35,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:35,724 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 5 states. [2018-11-23 08:36:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:35,939 INFO L93 Difference]: Finished difference Result 923 states and 1242 transitions. [2018-11-23 08:36:35,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:35,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-23 08:36:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:35,943 INFO L225 Difference]: With dead ends: 923 [2018-11-23 08:36:35,943 INFO L226 Difference]: Without dead ends: 917 [2018-11-23 08:36:35,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-11-23 08:36:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 915. [2018-11-23 08:36:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-11-23 08:36:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-11-23 08:36:35,970 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 44 [2018-11-23 08:36:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:35,971 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-11-23 08:36:35,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-11-23 08:36:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 08:36:35,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:35,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:35,972 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:35,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:35,972 INFO L82 PathProgramCache]: Analyzing trace with hash 381844807, now seen corresponding path program 1 times [2018-11-23 08:36:35,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:35,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:36,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-11-23 08:36:36,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:36,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:36:36,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:36:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:36:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:36:36,007 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 4 states. [2018-11-23 08:36:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:36,056 INFO L93 Difference]: Finished difference Result 943 states and 1268 transitions. [2018-11-23 08:36:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:36:36,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-23 08:36:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:36,059 INFO L225 Difference]: With dead ends: 943 [2018-11-23 08:36:36,059 INFO L226 Difference]: Without dead ends: 921 [2018-11-23 08:36:36,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-11-23 08:36:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2018-11-23 08:36:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-11-23 08:36:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-11-23 08:36:36,085 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 43 [2018-11-23 08:36:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:36,086 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-11-23 08:36:36,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:36:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-11-23 08:36:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 08:36:36,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:36,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:36,087 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:36,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:36,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1717093558, now seen corresponding path program 1 times [2018-11-23 08:36:36,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:36,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:36,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:36,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:36,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:36,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:36,143 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 5 states. [2018-11-23 08:36:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:36,538 INFO L93 Difference]: Finished difference Result 1639 states and 2181 transitions. [2018-11-23 08:36:36,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:36,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 08:36:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:36,542 INFO L225 Difference]: With dead ends: 1639 [2018-11-23 08:36:36,542 INFO L226 Difference]: Without dead ends: 1088 [2018-11-23 08:36:36,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-11-23 08:36:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 906. [2018-11-23 08:36:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-23 08:36:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2018-11-23 08:36:36,574 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 45 [2018-11-23 08:36:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:36,575 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2018-11-23 08:36:36,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2018-11-23 08:36:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 08:36:36,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:36,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:36,576 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:36,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:36,576 INFO L82 PathProgramCache]: Analyzing trace with hash 700175398, now seen corresponding path program 1 times [2018-11-23 08:36:36,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:36,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:36,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:36,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:36,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:36,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:36,608 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2018-11-23 08:36:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:36,648 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2018-11-23 08:36:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:36,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 08:36:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:36,651 INFO L225 Difference]: With dead ends: 922 [2018-11-23 08:36:36,651 INFO L226 Difference]: Without dead ends: 904 [2018-11-23 08:36:36,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-23 08:36:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-11-23 08:36:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 08:36:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2018-11-23 08:36:36,682 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2018-11-23 08:36:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:36,683 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2018-11-23 08:36:36,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2018-11-23 08:36:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 08:36:36,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:36,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:36,684 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:36,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash -47081320, now seen corresponding path program 1 times [2018-11-23 08:36:36,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:36,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:36,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:36,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:36,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:36,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:36,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:36,707 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2018-11-23 08:36:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:36,751 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2018-11-23 08:36:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:36,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-23 08:36:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:36,754 INFO L225 Difference]: With dead ends: 944 [2018-11-23 08:36:36,754 INFO L226 Difference]: Without dead ends: 868 [2018-11-23 08:36:36,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-11-23 08:36:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2018-11-23 08:36:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-23 08:36:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2018-11-23 08:36:36,783 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2018-11-23 08:36:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:36,783 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2018-11-23 08:36:36,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2018-11-23 08:36:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 08:36:36,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:36,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:36,784 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:36,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1679726262, now seen corresponding path program 1 times [2018-11-23 08:36:36,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:36,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:36,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:36,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:36,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:36,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:36,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:36,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:36,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:36,820 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2018-11-23 08:36:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:36,860 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2018-11-23 08:36:36,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:36,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-23 08:36:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:36,863 INFO L225 Difference]: With dead ends: 881 [2018-11-23 08:36:36,863 INFO L226 Difference]: Without dead ends: 863 [2018-11-23 08:36:36,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-23 08:36:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-11-23 08:36:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-11-23 08:36:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2018-11-23 08:36:36,891 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2018-11-23 08:36:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:36,891 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2018-11-23 08:36:36,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2018-11-23 08:36:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 08:36:36,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:36,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:36,892 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:36,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1637294242, now seen corresponding path program 1 times [2018-11-23 08:36:36,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:36,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:36,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:36,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:36,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:36,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:36,932 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 6 states. [2018-11-23 08:36:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:36,998 INFO L93 Difference]: Finished difference Result 883 states and 1175 transitions. [2018-11-23 08:36:36,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:36,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-23 08:36:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:37,002 INFO L225 Difference]: With dead ends: 883 [2018-11-23 08:36:37,002 INFO L226 Difference]: Without dead ends: 863 [2018-11-23 08:36:37,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-23 08:36:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-11-23 08:36:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-11-23 08:36:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1143 transitions. [2018-11-23 08:36:37,048 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1143 transitions. Word has length 50 [2018-11-23 08:36:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:37,048 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1143 transitions. [2018-11-23 08:36:37,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1143 transitions. [2018-11-23 08:36:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 08:36:37,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:37,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:37,049 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:37,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1826385380, now seen corresponding path program 1 times [2018-11-23 08:36:37,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:37,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:37,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:37,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:37,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:37,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:37,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:37,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:37,092 INFO L87 Difference]: Start difference. First operand 863 states and 1143 transitions. Second operand 3 states. [2018-11-23 08:36:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:37,177 INFO L93 Difference]: Finished difference Result 1180 states and 1584 transitions. [2018-11-23 08:36:37,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:37,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-23 08:36:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:37,180 INFO L225 Difference]: With dead ends: 1180 [2018-11-23 08:36:37,180 INFO L226 Difference]: Without dead ends: 1153 [2018-11-23 08:36:37,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-11-23 08:36:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 966. [2018-11-23 08:36:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-11-23 08:36:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1285 transitions. [2018-11-23 08:36:37,216 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1285 transitions. Word has length 50 [2018-11-23 08:36:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:37,217 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 1285 transitions. [2018-11-23 08:36:37,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1285 transitions. [2018-11-23 08:36:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 08:36:37,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:37,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:37,218 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:37,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash -273092308, now seen corresponding path program 1 times [2018-11-23 08:36:37,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:37,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:37,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:37,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:37,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:37,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:36:37,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:36:37,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:36:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:36:37,256 INFO L87 Difference]: Start difference. First operand 966 states and 1285 transitions. Second operand 4 states. [2018-11-23 08:36:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:37,379 INFO L93 Difference]: Finished difference Result 1059 states and 1376 transitions. [2018-11-23 08:36:37,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:36:37,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-11-23 08:36:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:37,381 INFO L225 Difference]: With dead ends: 1059 [2018-11-23 08:36:37,381 INFO L226 Difference]: Without dead ends: 659 [2018-11-23 08:36:37,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:36:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-23 08:36:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 622. [2018-11-23 08:36:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-23 08:36:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2018-11-23 08:36:37,405 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 52 [2018-11-23 08:36:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:37,405 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2018-11-23 08:36:37,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:36:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2018-11-23 08:36:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 08:36:37,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:37,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:37,406 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:37,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash 998036193, now seen corresponding path program 1 times [2018-11-23 08:36:37,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:37,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:37,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:37,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:36:37,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:36:37,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:36:37,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:37,452 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2018-11-23 08:36:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:37,528 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2018-11-23 08:36:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:36:37,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 08:36:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:37,531 INFO L225 Difference]: With dead ends: 661 [2018-11-23 08:36:37,531 INFO L226 Difference]: Without dead ends: 612 [2018-11-23 08:36:37,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 08:36:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-23 08:36:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2018-11-23 08:36:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-23 08:36:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-11-23 08:36:37,554 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2018-11-23 08:36:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:37,554 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-11-23 08:36:37,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:36:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-11-23 08:36:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 08:36:37,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:37,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:37,555 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:37,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1800502866, now seen corresponding path program 1 times [2018-11-23 08:36:37,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:37,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:37,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:37,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:37,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:37,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:37,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:37,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:37,596 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2018-11-23 08:36:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:37,640 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2018-11-23 08:36:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:37,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-23 08:36:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:37,643 INFO L225 Difference]: With dead ends: 637 [2018-11-23 08:36:37,643 INFO L226 Difference]: Without dead ends: 612 [2018-11-23 08:36:37,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-23 08:36:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-11-23 08:36:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-23 08:36:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2018-11-23 08:36:37,666 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2018-11-23 08:36:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:37,666 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2018-11-23 08:36:37,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2018-11-23 08:36:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 08:36:37,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:37,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:37,668 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:37,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1235297599, now seen corresponding path program 1 times [2018-11-23 08:36:37,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:37,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:37,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:37,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:37,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-11-23 08:36:37,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:37,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 08:36:37,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:36:37,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:36:37,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:36:37,728 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2018-11-23 08:36:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:37,839 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2018-11-23 08:36:37,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:36:37,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 08:36:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:37,842 INFO L225 Difference]: With dead ends: 642 [2018-11-23 08:36:37,842 INFO L226 Difference]: Without dead ends: 638 [2018-11-23 08:36:37,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-23 08:36:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2018-11-23 08:36:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-11-23 08:36:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2018-11-23 08:36:37,872 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2018-11-23 08:36:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:37,872 INFO L480 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2018-11-23 08:36:37,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:36:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2018-11-23 08:36:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 08:36:37,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:37,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:37,874 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:37,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1235020769, now seen corresponding path program 1 times [2018-11-23 08:36:37,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:37,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:37,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:37,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 08:36:37,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:36:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:36:37,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:36:37,931 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2018-11-23 08:36:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:38,010 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2018-11-23 08:36:38,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:36:38,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 08:36:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:38,013 INFO L225 Difference]: With dead ends: 1024 [2018-11-23 08:36:38,013 INFO L226 Difference]: Without dead ends: 670 [2018-11-23 08:36:38,014 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-11-23 08:36:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-23 08:36:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-11-23 08:36:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-23 08:36:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2018-11-23 08:36:38,055 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2018-11-23 08:36:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:38,056 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2018-11-23 08:36:38,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:36:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2018-11-23 08:36:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 08:36:38,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:38,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:38,057 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:38,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash -203655125, now seen corresponding path program 1 times [2018-11-23 08:36:38,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:38,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:38,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:38,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:36:38,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:36:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:36:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:38,109 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 7 states. [2018-11-23 08:36:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:38,551 INFO L93 Difference]: Finished difference Result 805 states and 1032 transitions. [2018-11-23 08:36:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:36:38,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-23 08:36:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:38,554 INFO L225 Difference]: With dead ends: 805 [2018-11-23 08:36:38,554 INFO L226 Difference]: Without dead ends: 708 [2018-11-23 08:36:38,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:36:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-11-23 08:36:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 680. [2018-11-23 08:36:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-23 08:36:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 873 transitions. [2018-11-23 08:36:38,583 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 873 transitions. Word has length 52 [2018-11-23 08:36:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:38,583 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 873 transitions. [2018-11-23 08:36:38,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:36:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 873 transitions. [2018-11-23 08:36:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 08:36:38,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:38,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:38,584 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:38,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash -60375767, now seen corresponding path program 1 times [2018-11-23 08:36:38,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:38,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:38,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:38,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:38,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:38,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:38,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:38,612 INFO L87 Difference]: Start difference. First operand 680 states and 873 transitions. Second operand 3 states. [2018-11-23 08:36:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:38,693 INFO L93 Difference]: Finished difference Result 838 states and 1091 transitions. [2018-11-23 08:36:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:38,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-23 08:36:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:38,696 INFO L225 Difference]: With dead ends: 838 [2018-11-23 08:36:38,696 INFO L226 Difference]: Without dead ends: 765 [2018-11-23 08:36:38,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-23 08:36:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 653. [2018-11-23 08:36:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-23 08:36:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 852 transitions. [2018-11-23 08:36:38,726 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 852 transitions. Word has length 52 [2018-11-23 08:36:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:38,727 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 852 transitions. [2018-11-23 08:36:38,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 852 transitions. [2018-11-23 08:36:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 08:36:38,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:38,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:38,728 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:38,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2114998175, now seen corresponding path program 1 times [2018-11-23 08:36:38,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:38,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:38,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:38,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:38,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:38,789 INFO L87 Difference]: Start difference. First operand 653 states and 852 transitions. Second operand 9 states. [2018-11-23 08:36:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:39,667 INFO L93 Difference]: Finished difference Result 850 states and 1093 transitions. [2018-11-23 08:36:39,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 08:36:39,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-23 08:36:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:39,670 INFO L225 Difference]: With dead ends: 850 [2018-11-23 08:36:39,670 INFO L226 Difference]: Without dead ends: 783 [2018-11-23 08:36:39,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-23 08:36:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-11-23 08:36:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 620. [2018-11-23 08:36:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-23 08:36:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 789 transitions. [2018-11-23 08:36:39,699 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 789 transitions. Word has length 52 [2018-11-23 08:36:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:39,699 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 789 transitions. [2018-11-23 08:36:39,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 789 transitions. [2018-11-23 08:36:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 08:36:39,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:39,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:39,700 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:39,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:39,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1870270086, now seen corresponding path program 1 times [2018-11-23 08:36:39,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:39,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:39,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:39,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:39,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:39,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:39,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:39,741 INFO L87 Difference]: Start difference. First operand 620 states and 789 transitions. Second operand 5 states. [2018-11-23 08:36:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:40,014 INFO L93 Difference]: Finished difference Result 767 states and 997 transitions. [2018-11-23 08:36:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:40,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-23 08:36:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:40,018 INFO L225 Difference]: With dead ends: 767 [2018-11-23 08:36:40,018 INFO L226 Difference]: Without dead ends: 749 [2018-11-23 08:36:40,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-23 08:36:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 603. [2018-11-23 08:36:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-11-23 08:36:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 762 transitions. [2018-11-23 08:36:40,050 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 762 transitions. Word has length 54 [2018-11-23 08:36:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:40,050 INFO L480 AbstractCegarLoop]: Abstraction has 603 states and 762 transitions. [2018-11-23 08:36:40,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 762 transitions. [2018-11-23 08:36:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 08:36:40,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:40,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:40,052 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:40,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -936674225, now seen corresponding path program 1 times [2018-11-23 08:36:40,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:40,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:40,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:40,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:40,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 08:36:40,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:36:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:36:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:36:40,107 INFO L87 Difference]: Start difference. First operand 603 states and 762 transitions. Second operand 8 states. [2018-11-23 08:36:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:40,152 INFO L93 Difference]: Finished difference Result 616 states and 774 transitions. [2018-11-23 08:36:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:36:40,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-23 08:36:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:40,154 INFO L225 Difference]: With dead ends: 616 [2018-11-23 08:36:40,154 INFO L226 Difference]: Without dead ends: 588 [2018-11-23 08:36:40,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-11-23 08:36:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2018-11-23 08:36:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-23 08:36:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 743 transitions. [2018-11-23 08:36:40,182 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 743 transitions. Word has length 55 [2018-11-23 08:36:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:40,182 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 743 transitions. [2018-11-23 08:36:40,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:36:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 743 transitions. [2018-11-23 08:36:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 08:36:40,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:40,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:40,184 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:40,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash -492692256, now seen corresponding path program 1 times [2018-11-23 08:36:40,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:40,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:40,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:40,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:40,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:40,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:40,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:40,226 INFO L87 Difference]: Start difference. First operand 588 states and 743 transitions. Second operand 3 states. [2018-11-23 08:36:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:40,307 INFO L93 Difference]: Finished difference Result 896 states and 1142 transitions. [2018-11-23 08:36:40,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:40,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-23 08:36:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:40,310 INFO L225 Difference]: With dead ends: 896 [2018-11-23 08:36:40,310 INFO L226 Difference]: Without dead ends: 587 [2018-11-23 08:36:40,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-23 08:36:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-11-23 08:36:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-11-23 08:36:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 739 transitions. [2018-11-23 08:36:40,364 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 739 transitions. Word has length 58 [2018-11-23 08:36:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:40,364 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 739 transitions. [2018-11-23 08:36:40,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 739 transitions. [2018-11-23 08:36:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 08:36:40,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:40,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:40,366 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:40,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash 331311930, now seen corresponding path program 1 times [2018-11-23 08:36:40,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:40,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:40,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:40,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:40,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:40,493 INFO L87 Difference]: Start difference. First operand 587 states and 739 transitions. Second operand 5 states. [2018-11-23 08:36:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:40,565 INFO L93 Difference]: Finished difference Result 846 states and 1074 transitions. [2018-11-23 08:36:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:40,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-23 08:36:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:40,568 INFO L225 Difference]: With dead ends: 846 [2018-11-23 08:36:40,568 INFO L226 Difference]: Without dead ends: 538 [2018-11-23 08:36:40,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-11-23 08:36:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-11-23 08:36:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-11-23 08:36:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 671 transitions. [2018-11-23 08:36:40,625 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 671 transitions. Word has length 64 [2018-11-23 08:36:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:40,625 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 671 transitions. [2018-11-23 08:36:40,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 671 transitions. [2018-11-23 08:36:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 08:36:40,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:40,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:40,627 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:40,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash 800339537, now seen corresponding path program 1 times [2018-11-23 08:36:40,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:40,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:40,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:40,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:40,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:40,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 08:36:40,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:36:40,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:36:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:36:40,711 INFO L87 Difference]: Start difference. First operand 538 states and 671 transitions. Second operand 8 states. [2018-11-23 08:36:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:40,853 INFO L93 Difference]: Finished difference Result 552 states and 684 transitions. [2018-11-23 08:36:40,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:36:40,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-23 08:36:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:40,856 INFO L225 Difference]: With dead ends: 552 [2018-11-23 08:36:40,856 INFO L226 Difference]: Without dead ends: 534 [2018-11-23 08:36:40,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-11-23 08:36:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-11-23 08:36:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-11-23 08:36:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 665 transitions. [2018-11-23 08:36:40,882 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 665 transitions. Word has length 58 [2018-11-23 08:36:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:40,883 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 665 transitions. [2018-11-23 08:36:40,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:36:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 665 transitions. [2018-11-23 08:36:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 08:36:40,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:40,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:40,884 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:40,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash -247744455, now seen corresponding path program 1 times [2018-11-23 08:36:40,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:40,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:40,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:40,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:40,920 INFO L87 Difference]: Start difference. First operand 534 states and 665 transitions. Second operand 6 states. [2018-11-23 08:36:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:40,979 INFO L93 Difference]: Finished difference Result 553 states and 684 transitions. [2018-11-23 08:36:40,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:40,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-23 08:36:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:40,981 INFO L225 Difference]: With dead ends: 553 [2018-11-23 08:36:40,981 INFO L226 Difference]: Without dead ends: 529 [2018-11-23 08:36:40,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-23 08:36:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-23 08:36:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-23 08:36:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 659 transitions. [2018-11-23 08:36:41,007 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 659 transitions. Word has length 60 [2018-11-23 08:36:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:41,007 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 659 transitions. [2018-11-23 08:36:41,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 659 transitions. [2018-11-23 08:36:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 08:36:41,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:41,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:41,009 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:41,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash 502127777, now seen corresponding path program 1 times [2018-11-23 08:36:41,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:41,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:41,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:41,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:41,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:41,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:41,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:41,056 INFO L87 Difference]: Start difference. First operand 529 states and 659 transitions. Second operand 5 states. [2018-11-23 08:36:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:41,233 INFO L93 Difference]: Finished difference Result 788 states and 988 transitions. [2018-11-23 08:36:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:41,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-23 08:36:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:41,235 INFO L225 Difference]: With dead ends: 788 [2018-11-23 08:36:41,235 INFO L226 Difference]: Without dead ends: 529 [2018-11-23 08:36:41,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-23 08:36:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-23 08:36:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-23 08:36:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 657 transitions. [2018-11-23 08:36:41,262 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 657 transitions. Word has length 68 [2018-11-23 08:36:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:41,262 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 657 transitions. [2018-11-23 08:36:41,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 657 transitions. [2018-11-23 08:36:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 08:36:41,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:41,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:41,264 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:41,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:41,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1762057128, now seen corresponding path program 1 times [2018-11-23 08:36:41,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:41,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:41,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:41,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:41,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:41,307 INFO L87 Difference]: Start difference. First operand 529 states and 657 transitions. Second operand 5 states. [2018-11-23 08:36:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:41,344 INFO L93 Difference]: Finished difference Result 648 states and 797 transitions. [2018-11-23 08:36:41,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:41,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 08:36:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:41,347 INFO L225 Difference]: With dead ends: 648 [2018-11-23 08:36:41,347 INFO L226 Difference]: Without dead ends: 535 [2018-11-23 08:36:41,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-23 08:36:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-11-23 08:36:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-23 08:36:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 661 transitions. [2018-11-23 08:36:41,375 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 661 transitions. Word has length 63 [2018-11-23 08:36:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:41,376 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 661 transitions. [2018-11-23 08:36:41,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 661 transitions. [2018-11-23 08:36:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 08:36:41,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:41,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:41,377 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:41,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 517740439, now seen corresponding path program 1 times [2018-11-23 08:36:41,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:41,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:41,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:41,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:41,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:41,436 INFO L87 Difference]: Start difference. First operand 533 states and 661 transitions. Second operand 9 states. [2018-11-23 08:36:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:41,491 INFO L93 Difference]: Finished difference Result 666 states and 815 transitions. [2018-11-23 08:36:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:41,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-23 08:36:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:41,494 INFO L225 Difference]: With dead ends: 666 [2018-11-23 08:36:41,494 INFO L226 Difference]: Without dead ends: 535 [2018-11-23 08:36:41,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-23 08:36:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-11-23 08:36:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-23 08:36:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-11-23 08:36:41,522 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 63 [2018-11-23 08:36:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:41,523 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-11-23 08:36:41,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-11-23 08:36:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 08:36:41,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:41,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:41,524 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:41,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1193132232, now seen corresponding path program 1 times [2018-11-23 08:36:41,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:41,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:41,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:41,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:41,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:41,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:36:41,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:36:41,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:36:41,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:41,552 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 3 states. [2018-11-23 08:36:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:41,587 INFO L93 Difference]: Finished difference Result 808 states and 1014 transitions. [2018-11-23 08:36:41,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:36:41,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-23 08:36:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:41,590 INFO L225 Difference]: With dead ends: 808 [2018-11-23 08:36:41,590 INFO L226 Difference]: Without dead ends: 549 [2018-11-23 08:36:41,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:36:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-11-23 08:36:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2018-11-23 08:36:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-23 08:36:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-11-23 08:36:41,621 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 71 [2018-11-23 08:36:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:41,621 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-11-23 08:36:41,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:36:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-11-23 08:36:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 08:36:41,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:41,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:41,622 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:41,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1107799800, now seen corresponding path program 1 times [2018-11-23 08:36:41,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:41,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:41,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:41,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:41,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:41,691 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 6 states. [2018-11-23 08:36:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:41,740 INFO L93 Difference]: Finished difference Result 776 states and 968 transitions. [2018-11-23 08:36:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:41,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-23 08:36:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:41,742 INFO L225 Difference]: With dead ends: 776 [2018-11-23 08:36:41,742 INFO L226 Difference]: Without dead ends: 550 [2018-11-23 08:36:41,743 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-11-23 08:36:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-11-23 08:36:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2018-11-23 08:36:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-23 08:36:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 658 transitions. [2018-11-23 08:36:41,771 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 658 transitions. Word has length 71 [2018-11-23 08:36:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:41,771 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 658 transitions. [2018-11-23 08:36:41,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 658 transitions. [2018-11-23 08:36:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 08:36:41,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:41,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:41,772 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:41,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash 848393777, now seen corresponding path program 1 times [2018-11-23 08:36:41,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:41,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:41,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:41,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:41,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:41,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:41,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:41,832 INFO L87 Difference]: Start difference. First operand 533 states and 658 transitions. Second operand 9 states. [2018-11-23 08:36:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:41,962 INFO L93 Difference]: Finished difference Result 550 states and 675 transitions. [2018-11-23 08:36:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:41,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-23 08:36:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:41,965 INFO L225 Difference]: With dead ends: 550 [2018-11-23 08:36:41,965 INFO L226 Difference]: Without dead ends: 529 [2018-11-23 08:36:41,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-23 08:36:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-23 08:36:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-23 08:36:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 652 transitions. [2018-11-23 08:36:42,008 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 652 transitions. Word has length 63 [2018-11-23 08:36:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:42,008 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 652 transitions. [2018-11-23 08:36:42,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 652 transitions. [2018-11-23 08:36:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 08:36:42,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:42,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:42,010 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:42,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1112788646, now seen corresponding path program 1 times [2018-11-23 08:36:42,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:42,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:42,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:42,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:42,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 08:36:42,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:36:42,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:36:42,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:36:42,063 INFO L87 Difference]: Start difference. First operand 529 states and 652 transitions. Second operand 8 states. [2018-11-23 08:36:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:42,207 INFO L93 Difference]: Finished difference Result 540 states and 662 transitions. [2018-11-23 08:36:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:36:42,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-23 08:36:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:42,209 INFO L225 Difference]: With dead ends: 540 [2018-11-23 08:36:42,209 INFO L226 Difference]: Without dead ends: 518 [2018-11-23 08:36:42,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-23 08:36:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-11-23 08:36:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-23 08:36:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 637 transitions. [2018-11-23 08:36:42,251 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 637 transitions. Word has length 64 [2018-11-23 08:36:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:42,251 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 637 transitions. [2018-11-23 08:36:42,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:36:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 637 transitions. [2018-11-23 08:36:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 08:36:42,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:42,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:42,253 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:42,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash -757918773, now seen corresponding path program 1 times [2018-11-23 08:36:42,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:42,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:42,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:42,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:42,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:42,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:42,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:42,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:42,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:42,318 INFO L87 Difference]: Start difference. First operand 518 states and 637 transitions. Second operand 9 states. [2018-11-23 08:36:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:42,503 INFO L93 Difference]: Finished difference Result 535 states and 654 transitions. [2018-11-23 08:36:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:42,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-23 08:36:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:42,505 INFO L225 Difference]: With dead ends: 535 [2018-11-23 08:36:42,506 INFO L226 Difference]: Without dead ends: 513 [2018-11-23 08:36:42,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-11-23 08:36:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-11-23 08:36:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-23 08:36:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 630 transitions. [2018-11-23 08:36:42,543 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 630 transitions. Word has length 64 [2018-11-23 08:36:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:42,543 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 630 transitions. [2018-11-23 08:36:42,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 630 transitions. [2018-11-23 08:36:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 08:36:42,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:42,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:42,544 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:42,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1688030243, now seen corresponding path program 1 times [2018-11-23 08:36:42,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:42,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:42,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:42,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:42,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:42,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:42,610 INFO L87 Difference]: Start difference. First operand 513 states and 630 transitions. Second operand 9 states. [2018-11-23 08:36:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:42,749 INFO L93 Difference]: Finished difference Result 530 states and 647 transitions. [2018-11-23 08:36:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:42,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-23 08:36:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:42,750 INFO L225 Difference]: With dead ends: 530 [2018-11-23 08:36:42,751 INFO L226 Difference]: Without dead ends: 509 [2018-11-23 08:36:42,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-11-23 08:36:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-11-23 08:36:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-11-23 08:36:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 624 transitions. [2018-11-23 08:36:42,774 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 624 transitions. Word has length 64 [2018-11-23 08:36:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:42,775 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 624 transitions. [2018-11-23 08:36:42,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 624 transitions. [2018-11-23 08:36:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 08:36:42,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:42,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:42,776 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:42,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:42,776 INFO L82 PathProgramCache]: Analyzing trace with hash 70476455, now seen corresponding path program 1 times [2018-11-23 08:36:42,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:42,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:42,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:42,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:42,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:42,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:42,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:42,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:42,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:42,849 INFO L87 Difference]: Start difference. First operand 509 states and 624 transitions. Second operand 5 states. [2018-11-23 08:36:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:43,098 INFO L93 Difference]: Finished difference Result 878 states and 1083 transitions. [2018-11-23 08:36:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:43,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-23 08:36:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:43,101 INFO L225 Difference]: With dead ends: 878 [2018-11-23 08:36:43,101 INFO L226 Difference]: Without dead ends: 625 [2018-11-23 08:36:43,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:36:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-23 08:36:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 583. [2018-11-23 08:36:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-11-23 08:36:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 718 transitions. [2018-11-23 08:36:43,132 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 718 transitions. Word has length 70 [2018-11-23 08:36:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:43,132 INFO L480 AbstractCegarLoop]: Abstraction has 583 states and 718 transitions. [2018-11-23 08:36:43,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2018-11-23 08:36:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 08:36:43,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:43,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:43,133 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:43,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:43,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1382250420, now seen corresponding path program 1 times [2018-11-23 08:36:43,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:43,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:43,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:43,194 INFO L87 Difference]: Start difference. First operand 583 states and 718 transitions. Second operand 9 states. [2018-11-23 08:36:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:43,308 INFO L93 Difference]: Finished difference Result 600 states and 735 transitions. [2018-11-23 08:36:43,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:43,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-23 08:36:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:43,310 INFO L225 Difference]: With dead ends: 600 [2018-11-23 08:36:43,311 INFO L226 Difference]: Without dead ends: 557 [2018-11-23 08:36:43,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-11-23 08:36:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-11-23 08:36:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-11-23 08:36:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 686 transitions. [2018-11-23 08:36:43,346 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 686 transitions. Word has length 68 [2018-11-23 08:36:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:43,346 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 686 transitions. [2018-11-23 08:36:43,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 686 transitions. [2018-11-23 08:36:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 08:36:43,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:43,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:43,348 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:43,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1735546476, now seen corresponding path program 1 times [2018-11-23 08:36:43,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:43,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:43,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:43,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:43,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:43,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:43,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:43,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:43,405 INFO L87 Difference]: Start difference. First operand 557 states and 686 transitions. Second operand 9 states. [2018-11-23 08:36:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:43,494 INFO L93 Difference]: Finished difference Result 592 states and 726 transitions. [2018-11-23 08:36:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:43,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-23 08:36:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:43,497 INFO L225 Difference]: With dead ends: 592 [2018-11-23 08:36:43,497 INFO L226 Difference]: Without dead ends: 565 [2018-11-23 08:36:43,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-11-23 08:36:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2018-11-23 08:36:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-23 08:36:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 693 transitions. [2018-11-23 08:36:43,547 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 693 transitions. Word has length 76 [2018-11-23 08:36:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:43,547 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 693 transitions. [2018-11-23 08:36:43,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 693 transitions. [2018-11-23 08:36:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 08:36:43,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:43,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:43,549 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:43,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1846504819, now seen corresponding path program 1 times [2018-11-23 08:36:43,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:43,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:43,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:43,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:43,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:43,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:43,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:43,627 INFO L87 Difference]: Start difference. First operand 563 states and 693 transitions. Second operand 5 states. [2018-11-23 08:36:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:43,678 INFO L93 Difference]: Finished difference Result 657 states and 801 transitions. [2018-11-23 08:36:43,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:43,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-23 08:36:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:43,680 INFO L225 Difference]: With dead ends: 657 [2018-11-23 08:36:43,680 INFO L226 Difference]: Without dead ends: 510 [2018-11-23 08:36:43,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-23 08:36:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-11-23 08:36:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-11-23 08:36:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 624 transitions. [2018-11-23 08:36:43,724 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 624 transitions. Word has length 76 [2018-11-23 08:36:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:43,724 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 624 transitions. [2018-11-23 08:36:43,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 624 transitions. [2018-11-23 08:36:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 08:36:43,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:43,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:43,725 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:43,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1102145568, now seen corresponding path program 1 times [2018-11-23 08:36:43,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:43,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:43,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:43,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:36:43,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:36:43,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:36:43,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:43,806 INFO L87 Difference]: Start difference. First operand 510 states and 624 transitions. Second operand 7 states. [2018-11-23 08:36:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:44,271 INFO L93 Difference]: Finished difference Result 814 states and 1002 transitions. [2018-11-23 08:36:44,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:36:44,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-23 08:36:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:44,274 INFO L225 Difference]: With dead ends: 814 [2018-11-23 08:36:44,274 INFO L226 Difference]: Without dead ends: 505 [2018-11-23 08:36:44,275 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-11-23 08:36:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-23 08:36:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2018-11-23 08:36:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-23 08:36:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 599 transitions. [2018-11-23 08:36:44,301 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 599 transitions. Word has length 82 [2018-11-23 08:36:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:44,302 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 599 transitions. [2018-11-23 08:36:44,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:36:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 599 transitions. [2018-11-23 08:36:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 08:36:44,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:44,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:44,303 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:44,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1177659047, now seen corresponding path program 1 times [2018-11-23 08:36:44,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:44,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:44,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:44,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:44,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:44,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:44,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:44,354 INFO L87 Difference]: Start difference. First operand 494 states and 599 transitions. Second operand 6 states. [2018-11-23 08:36:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:44,400 INFO L93 Difference]: Finished difference Result 801 states and 999 transitions. [2018-11-23 08:36:44,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:44,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-23 08:36:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:44,403 INFO L225 Difference]: With dead ends: 801 [2018-11-23 08:36:44,403 INFO L226 Difference]: Without dead ends: 547 [2018-11-23 08:36:44,404 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-11-23 08:36:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-11-23 08:36:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 460. [2018-11-23 08:36:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-23 08:36:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 555 transitions. [2018-11-23 08:36:44,430 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 555 transitions. Word has length 83 [2018-11-23 08:36:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:44,430 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 555 transitions. [2018-11-23 08:36:44,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 555 transitions. [2018-11-23 08:36:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 08:36:44,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:44,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:44,431 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:44,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:44,432 INFO L82 PathProgramCache]: Analyzing trace with hash 583311642, now seen corresponding path program 1 times [2018-11-23 08:36:44,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:44,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:44,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:44,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:44,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:44,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:44,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:44,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:44,485 INFO L87 Difference]: Start difference. First operand 460 states and 555 transitions. Second operand 5 states. [2018-11-23 08:36:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:44,717 INFO L93 Difference]: Finished difference Result 880 states and 1043 transitions. [2018-11-23 08:36:44,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:44,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-23 08:36:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:44,719 INFO L225 Difference]: With dead ends: 880 [2018-11-23 08:36:44,719 INFO L226 Difference]: Without dead ends: 561 [2018-11-23 08:36:44,720 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-11-23 08:36:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-11-23 08:36:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 538. [2018-11-23 08:36:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-11-23 08:36:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 637 transitions. [2018-11-23 08:36:44,769 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 637 transitions. Word has length 78 [2018-11-23 08:36:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:44,769 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 637 transitions. [2018-11-23 08:36:44,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 637 transitions. [2018-11-23 08:36:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 08:36:44,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:44,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:44,771 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:44,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash -561171894, now seen corresponding path program 1 times [2018-11-23 08:36:44,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:44,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:44,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:44,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:44,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:44,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:44,839 INFO L87 Difference]: Start difference. First operand 538 states and 637 transitions. Second operand 9 states. [2018-11-23 08:36:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:44,967 INFO L93 Difference]: Finished difference Result 540 states and 638 transitions. [2018-11-23 08:36:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:44,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-23 08:36:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:44,969 INFO L225 Difference]: With dead ends: 540 [2018-11-23 08:36:44,969 INFO L226 Difference]: Without dead ends: 449 [2018-11-23 08:36:44,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-23 08:36:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-11-23 08:36:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-23 08:36:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 535 transitions. [2018-11-23 08:36:45,026 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 535 transitions. Word has length 81 [2018-11-23 08:36:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:45,027 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 535 transitions. [2018-11-23 08:36:45,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 535 transitions. [2018-11-23 08:36:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 08:36:45,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:45,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:45,028 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:45,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1831635273, now seen corresponding path program 1 times [2018-11-23 08:36:45,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:45,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-11-23 08:36:45,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:45,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:45,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:45,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:45,093 INFO L87 Difference]: Start difference. First operand 449 states and 535 transitions. Second operand 9 states. [2018-11-23 08:36:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:45,223 INFO L93 Difference]: Finished difference Result 470 states and 557 transitions. [2018-11-23 08:36:45,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:45,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-23 08:36:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:45,225 INFO L225 Difference]: With dead ends: 470 [2018-11-23 08:36:45,225 INFO L226 Difference]: Without dead ends: 449 [2018-11-23 08:36:45,226 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-11-23 08:36:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-23 08:36:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-11-23 08:36:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-23 08:36:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 534 transitions. [2018-11-23 08:36:45,250 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 534 transitions. Word has length 88 [2018-11-23 08:36:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:45,250 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 534 transitions. [2018-11-23 08:36:45,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 534 transitions. [2018-11-23 08:36:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 08:36:45,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:45,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:45,252 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:45,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1636495317, now seen corresponding path program 1 times [2018-11-23 08:36:45,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:45,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:45,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:45,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:45,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:45,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:45,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:45,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:45,289 INFO L87 Difference]: Start difference. First operand 449 states and 534 transitions. Second operand 6 states. [2018-11-23 08:36:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:45,332 INFO L93 Difference]: Finished difference Result 482 states and 566 transitions. [2018-11-23 08:36:45,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:45,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-23 08:36:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:45,335 INFO L225 Difference]: With dead ends: 482 [2018-11-23 08:36:45,335 INFO L226 Difference]: Without dead ends: 443 [2018-11-23 08:36:45,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-23 08:36:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 390. [2018-11-23 08:36:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-23 08:36:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 458 transitions. [2018-11-23 08:36:45,358 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 458 transitions. Word has length 99 [2018-11-23 08:36:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:45,359 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 458 transitions. [2018-11-23 08:36:45,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 458 transitions. [2018-11-23 08:36:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 08:36:45,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:45,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:45,360 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:45,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash -363913567, now seen corresponding path program 1 times [2018-11-23 08:36:45,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:45,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:45,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:45,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:45,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:45,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:36:45,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:36:45,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:36:45,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:36:45,408 INFO L87 Difference]: Start difference. First operand 390 states and 458 transitions. Second operand 7 states. [2018-11-23 08:36:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:45,518 INFO L93 Difference]: Finished difference Result 736 states and 870 transitions. [2018-11-23 08:36:45,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:45,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-23 08:36:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:45,521 INFO L225 Difference]: With dead ends: 736 [2018-11-23 08:36:45,521 INFO L226 Difference]: Without dead ends: 691 [2018-11-23 08:36:45,522 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-11-23 08:36:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-23 08:36:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 370. [2018-11-23 08:36:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-23 08:36:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 433 transitions. [2018-11-23 08:36:45,549 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 433 transitions. Word has length 99 [2018-11-23 08:36:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:45,549 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 433 transitions. [2018-11-23 08:36:45,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:36:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 433 transitions. [2018-11-23 08:36:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 08:36:45,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:45,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:45,550 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:45,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1119440733, now seen corresponding path program 1 times [2018-11-23 08:36:45,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:45,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:45,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:45,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 08:36:45,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 08:36:45,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 08:36:45,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:45,624 INFO L87 Difference]: Start difference. First operand 370 states and 433 transitions. Second operand 11 states. [2018-11-23 08:36:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:45,702 INFO L93 Difference]: Finished difference Result 515 states and 607 transitions. [2018-11-23 08:36:45,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:36:45,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2018-11-23 08:36:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:45,705 INFO L225 Difference]: With dead ends: 515 [2018-11-23 08:36:45,705 INFO L226 Difference]: Without dead ends: 366 [2018-11-23 08:36:45,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 08:36:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-23 08:36:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2018-11-23 08:36:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-11-23 08:36:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 410 transitions. [2018-11-23 08:36:45,730 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 410 transitions. Word has length 104 [2018-11-23 08:36:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:45,730 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 410 transitions. [2018-11-23 08:36:45,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 08:36:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 410 transitions. [2018-11-23 08:36:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 08:36:45,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:45,732 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, 1, 1, 1] [2018-11-23 08:36:45,732 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:45,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1545373669, now seen corresponding path program 1 times [2018-11-23 08:36:45,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:45,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:36:45,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:45,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:45,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:45,786 INFO L87 Difference]: Start difference. First operand 353 states and 410 transitions. Second operand 6 states. [2018-11-23 08:36:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:45,819 INFO L93 Difference]: Finished difference Result 381 states and 437 transitions. [2018-11-23 08:36:45,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:45,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-23 08:36:45,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:45,821 INFO L225 Difference]: With dead ends: 381 [2018-11-23 08:36:45,822 INFO L226 Difference]: Without dead ends: 305 [2018-11-23 08:36:45,822 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-11-23 08:36:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-23 08:36:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2018-11-23 08:36:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-23 08:36:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2018-11-23 08:36:45,838 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 113 [2018-11-23 08:36:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:45,839 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2018-11-23 08:36:45,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2018-11-23 08:36:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 08:36:45,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:45,840 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] [2018-11-23 08:36:45,840 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:45,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:45,840 INFO L82 PathProgramCache]: Analyzing trace with hash 268673567, now seen corresponding path program 1 times [2018-11-23 08:36:45,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:45,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:45,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:45,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:36:45,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:45,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:45,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:45,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:45,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:45,910 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand 9 states. [2018-11-23 08:36:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:45,975 INFO L93 Difference]: Finished difference Result 316 states and 358 transitions. [2018-11-23 08:36:45,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:45,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-11-23 08:36:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:45,977 INFO L225 Difference]: With dead ends: 316 [2018-11-23 08:36:45,977 INFO L226 Difference]: Without dead ends: 287 [2018-11-23 08:36:45,977 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-11-23 08:36:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-23 08:36:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2018-11-23 08:36:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-23 08:36:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2018-11-23 08:36:45,995 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 134 [2018-11-23 08:36:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:45,996 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2018-11-23 08:36:45,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2018-11-23 08:36:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-23 08:36:45,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:45,997 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] [2018-11-23 08:36:45,997 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:45,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:45,997 INFO L82 PathProgramCache]: Analyzing trace with hash 13585617, now seen corresponding path program 1 times [2018-11-23 08:36:45,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:45,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:45,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 08:36:46,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:46,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:46,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:46,067 INFO L87 Difference]: Start difference. First operand 263 states and 295 transitions. Second operand 9 states. [2018-11-23 08:36:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:46,125 INFO L93 Difference]: Finished difference Result 338 states and 379 transitions. [2018-11-23 08:36:46,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:46,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-11-23 08:36:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:46,127 INFO L225 Difference]: With dead ends: 338 [2018-11-23 08:36:46,127 INFO L226 Difference]: Without dead ends: 267 [2018-11-23 08:36:46,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-23 08:36:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2018-11-23 08:36:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-23 08:36:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2018-11-23 08:36:46,147 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 135 [2018-11-23 08:36:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:46,147 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2018-11-23 08:36:46,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2018-11-23 08:36:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-23 08:36:46,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:46,149 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-11-23 08:36:46,149 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:46,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash -834804230, now seen corresponding path program 1 times [2018-11-23 08:36:46,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:46,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 08:36:46,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:46,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:46,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:36:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:46,211 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand 5 states. [2018-11-23 08:36:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:46,256 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2018-11-23 08:36:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:46,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-11-23 08:36:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:46,257 INFO L225 Difference]: With dead ends: 281 [2018-11-23 08:36:46,257 INFO L226 Difference]: Without dead ends: 251 [2018-11-23 08:36:46,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-23 08:36:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-11-23 08:36:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 08:36:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2018-11-23 08:36:46,275 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 150 [2018-11-23 08:36:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:46,275 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2018-11-23 08:36:46,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:36:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2018-11-23 08:36:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-23 08:36:46,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:46,277 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-11-23 08:36:46,277 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:46,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash -653317733, now seen corresponding path program 1 times [2018-11-23 08:36:46,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:46,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 08:36:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:46,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 08:36:46,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 08:36:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 08:36:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 08:36:46,395 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand 15 states. [2018-11-23 08:36:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:46,528 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-11-23 08:36:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 08:36:46,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2018-11-23 08:36:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:46,530 INFO L225 Difference]: With dead ends: 315 [2018-11-23 08:36:46,530 INFO L226 Difference]: Without dead ends: 280 [2018-11-23 08:36:46,530 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-11-23 08:36:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-23 08:36:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 266. [2018-11-23 08:36:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-23 08:36:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 295 transitions. [2018-11-23 08:36:46,550 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 295 transitions. Word has length 150 [2018-11-23 08:36:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:46,550 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 295 transitions. [2018-11-23 08:36:46,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 08:36:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 295 transitions. [2018-11-23 08:36:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 08:36:46,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:46,551 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] [2018-11-23 08:36:46,551 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:46,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1218236339, now seen corresponding path program 1 times [2018-11-23 08:36:46,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:36:46,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:46,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 08:36:46,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:36:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:36:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:36:46,620 INFO L87 Difference]: Start difference. First operand 266 states and 295 transitions. Second operand 9 states. [2018-11-23 08:36:46,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:46,673 INFO L93 Difference]: Finished difference Result 355 states and 396 transitions. [2018-11-23 08:36:46,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:36:46,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2018-11-23 08:36:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:46,675 INFO L225 Difference]: With dead ends: 355 [2018-11-23 08:36:46,675 INFO L226 Difference]: Without dead ends: 274 [2018-11-23 08:36:46,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:36:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-23 08:36:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-11-23 08:36:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-23 08:36:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 294 transitions. [2018-11-23 08:36:46,693 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 294 transitions. Word has length 151 [2018-11-23 08:36:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:46,694 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 294 transitions. [2018-11-23 08:36:46,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:36:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 294 transitions. [2018-11-23 08:36:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 08:36:46,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:46,695 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] [2018-11-23 08:36:46,695 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:46,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:46,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1765810406, now seen corresponding path program 1 times [2018-11-23 08:36:46,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:46,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 08:36:46,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:36:46,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:36:46,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:46,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 08:36:47,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:36:47,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-23 08:36:47,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 08:36:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 08:36:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-23 08:36:47,035 INFO L87 Difference]: Start difference. First operand 266 states and 294 transitions. Second operand 21 states. [2018-11-23 08:36:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:47,174 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-11-23 08:36:47,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 08:36:47,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2018-11-23 08:36:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:47,176 INFO L225 Difference]: With dead ends: 311 [2018-11-23 08:36:47,176 INFO L226 Difference]: Without dead ends: 270 [2018-11-23 08:36:47,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 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-11-23 08:36:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-23 08:36:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-11-23 08:36:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 08:36:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2018-11-23 08:36:47,198 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 153 [2018-11-23 08:36:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:47,199 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2018-11-23 08:36:47,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 08:36:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2018-11-23 08:36:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-23 08:36:47,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:47,201 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, 1] [2018-11-23 08:36:47,201 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:47,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash 244162299, now seen corresponding path program 1 times [2018-11-23 08:36:47,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:47,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 08:36:47,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:36:47,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/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-11-23 08:36:47,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:47,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 08:36:47,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:36:47,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-23 08:36:47,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 08:36:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 08:36:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:36:47,467 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 14 states. [2018-11-23 08:36:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:47,634 INFO L93 Difference]: Finished difference Result 321 states and 350 transitions. [2018-11-23 08:36:47,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:36:47,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2018-11-23 08:36:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:47,637 INFO L225 Difference]: With dead ends: 321 [2018-11-23 08:36:47,637 INFO L226 Difference]: Without dead ends: 246 [2018-11-23 08:36:47,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 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-11-23 08:36:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-23 08:36:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2018-11-23 08:36:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 08:36:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-11-23 08:36:47,656 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 158 [2018-11-23 08:36:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:47,656 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-11-23 08:36:47,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 08:36:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-11-23 08:36:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 08:36:47,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:47,658 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, 1, 1, 1] [2018-11-23 08:36:47,658 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:47,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1521484890, now seen corresponding path program 1 times [2018-11-23 08:36:47,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:47,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:47,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 08:36:47,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:47,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:47,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:36:47,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:47,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:47,712 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 6 states. [2018-11-23 08:36:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:47,747 INFO L93 Difference]: Finished difference Result 322 states and 349 transitions. [2018-11-23 08:36:47,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:47,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-11-23 08:36:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:47,749 INFO L225 Difference]: With dead ends: 322 [2018-11-23 08:36:47,749 INFO L226 Difference]: Without dead ends: 237 [2018-11-23 08:36:47,750 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-11-23 08:36:47,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-23 08:36:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2018-11-23 08:36:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-23 08:36:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2018-11-23 08:36:47,770 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 160 [2018-11-23 08:36:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:47,770 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2018-11-23 08:36:47,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:36:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2018-11-23 08:36:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-23 08:36:47,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:47,772 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, 1, 1, 1] [2018-11-23 08:36:47,772 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:47,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:47,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1127797900, now seen corresponding path program 1 times [2018-11-23 08:36:47,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:47,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:47,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:47,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:47,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 08:36:47,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 08:36:47,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 08:36:47,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 08:36:47,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 08:36:47,862 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 10 states. [2018-11-23 08:36:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:48,277 INFO L93 Difference]: Finished difference Result 456 states and 493 transitions. [2018-11-23 08:36:48,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 08:36:48,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-11-23 08:36:48,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:48,280 INFO L225 Difference]: With dead ends: 456 [2018-11-23 08:36:48,280 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 08:36:48,281 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-11-23 08:36:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 08:36:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-11-23 08:36:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-23 08:36:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 248 transitions. [2018-11-23 08:36:48,299 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 248 transitions. Word has length 161 [2018-11-23 08:36:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:48,299 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 248 transitions. [2018-11-23 08:36:48,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 08:36:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 248 transitions. [2018-11-23 08:36:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-23 08:36:48,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:36:48,301 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, 1, 1, 1] [2018-11-23 08:36:48,301 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:36:48,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash 204630474, now seen corresponding path program 1 times [2018-11-23 08:36:48,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:48,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 08:36:48,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:36:48,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/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-11-23 08:36:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:48,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:36:48,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:36:48,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-11-23 08:36:48,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 08:36:48,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 08:36:48,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-23 08:36:48,604 INFO L87 Difference]: Start difference. First operand 231 states and 248 transitions. Second operand 19 states. [2018-11-23 08:36:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:49,362 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2018-11-23 08:36:49,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 08:36:49,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 161 [2018-11-23 08:36:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:36:49,363 INFO L225 Difference]: With dead ends: 302 [2018-11-23 08:36:49,363 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 08:36:49,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 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-11-23 08:36:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 08:36:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 08:36:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 08:36:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 08:36:49,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-11-23 08:36:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:36:49,365 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:36:49,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 08:36:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:36:49,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:36:49,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 08:36:49,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:49,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:50,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 08:36:51,091 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-11-23 08:36:51,290 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 68 [2018-11-23 08:36:51,419 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2018-11-23 08:36:51,786 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-11-23 08:36:51,935 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 68 [2018-11-23 08:36:52,157 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 71 [2018-11-23 08:36:52,428 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 61 [2018-11-23 08:36:52,868 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 96 [2018-11-23 08:36:53,462 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 104 [2018-11-23 08:36:53,877 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-11-23 08:36:54,187 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 95 [2018-11-23 08:36:54,350 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2018-11-23 08:36:54,772 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-11-23 08:36:55,184 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2018-11-23 08:36:55,571 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 100 [2018-11-23 08:36:55,688 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2018-11-23 08:36:56,128 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 84 [2018-11-23 08:36:56,872 WARN L180 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 117 [2018-11-23 08:36:57,152 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2018-11-23 08:36:57,629 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 87 [2018-11-23 08:36:57,865 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2018-11-23 08:36:58,250 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2018-11-23 08:36:58,462 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2018-11-23 08:36:58,803 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 87 [2018-11-23 08:36:59,192 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-11-23 08:36:59,681 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-11-23 08:36:59,909 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2018-11-23 08:37:00,164 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-11-23 08:37:00,533 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 82 [2018-11-23 08:37:00,775 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 68 [2018-11-23 08:37:00,925 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2018-11-23 08:37:01,078 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-11-23 08:37:01,432 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2018-11-23 08:37:02,240 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-11-23 08:37:02,660 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-11-23 08:37:02,821 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-11-23 08:37:03,361 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-11-23 08:37:03,524 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2018-11-23 08:37:03,907 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 89 [2018-11-23 08:37:04,129 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 63 [2018-11-23 08:37:04,510 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2018-11-23 08:37:04,904 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2018-11-23 08:37:05,335 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2018-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2018-11-23 08:37:05,377 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2018-11-23 08:37:05,377 INFO L451 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2018-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 919 926) no Hoare annotation was computed. [2018-11-23 08:37:05,377 INFO L451 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2018-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2018-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 919 926) no Hoare annotation was computed. [2018-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2018-11-23 08:37:05,377 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) 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-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2018-11-23 08:37:05,377 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2018-11-23 08:37:05,378 INFO L451 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2018-11-23 08:37:05,378 INFO L451 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2018-11-23 08:37:05,378 INFO L448 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2018-11-23 08:37:05,378 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2018-11-23 08:37:05,378 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 940 947) no Hoare annotation was computed. [2018-11-23 08:37:05,378 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2018-11-23 08:37:05,378 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 940 947) no Hoare annotation was computed. [2018-11-23 08:37:05,378 INFO L444 ceAbstractionStarter]: At program point L225(lines 224 419) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-11-23 08:37:05,378 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-11-23 08:37:05,378 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2018-11-23 08:37:05,378 INFO L444 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (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))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,379 INFO L448 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2018-11-23 08:37:05,379 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2018-11-23 08:37:05,379 INFO L448 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2018-11-23 08:37:05,379 INFO L444 ceAbstractionStarter]: At program point L325(line 325) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,379 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2018-11-23 08:37:05,379 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2018-11-23 08:37:05,379 INFO L444 ceAbstractionStarter]: At program point L408(line 408) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,379 INFO L448 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2018-11-23 08:37:05,379 INFO L444 ceAbstractionStarter]: At program point L243(line 243) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,379 INFO L448 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2018-11-23 08:37:05,380 INFO L444 ceAbstractionStarter]: At program point L202(line 202) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,380 INFO L448 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2018-11-23 08:37:05,380 INFO L448 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2018-11-23 08:37:05,380 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 228 418) no Hoare annotation was computed. [2018-11-23 08:37:05,380 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 228 418) no Hoare annotation was computed. [2018-11-23 08:37:05,380 INFO L444 ceAbstractionStarter]: At program point L392(lines 392 393) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,380 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-11-23 08:37:05,380 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2018-11-23 08:37:05,380 INFO L444 ceAbstractionStarter]: At program point L227(lines 226 419) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-11-23 08:37:05,381 INFO L444 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse11 (= 0 ~pended~0)) (.cse12 (= ~DC~0 ~s~0)) (.cse8 (= 0 ~compRegistered~0)) (.cse10 (= ~pended~0 1))) (let ((.cse0 (and .cse12 .cse8 .cse10)) (.cse1 (and (= ~s~0 ~NP~0) .cse8 .cse10)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and .cse8 .cse10 (= ~IPC~0 ~s~0))) (.cse4 (and (and .cse12 .cse11) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse5 (and .cse11 .cse9 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (<= ~compRegistered~0 0))) (.cse6 (and .cse8 .cse9 .cse10)) (.cse7 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-11-23 08:37:05,381 INFO L444 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse4 (and (= 0 ~pended~0) (<= 1 ~compRegistered~0))) (.cse5 (<= ~s~0 1)) (.cse6 (<= 1 ~s~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7)) (.cse1 (and (not (= 259 FloppyPnp_~ntStatus~0)) .cse4 .cse5 .cse6 .cse7 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-11-23 08:37:05,381 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2018-11-23 08:37:05,381 INFO L444 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,381 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-11-23 08:37:05,381 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-11-23 08:37:05,382 INFO L448 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2018-11-23 08:37:05,382 INFO L444 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-11-23 08:37:05,382 INFO L448 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2018-11-23 08:37:05,382 INFO L444 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse4 (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 (= |old(~s~0)| ~s~0) (= ~pended~0 1))) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-11-23 08:37:05,382 INFO L448 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2018-11-23 08:37:05,382 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2018-11-23 08:37:05,382 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2018-11-23 08:37:05,382 INFO L444 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-11-23 08:37:05,382 INFO L448 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2018-11-23 08:37:05,383 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2018-11-23 08:37:05,383 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2018-11-23 08:37:05,383 INFO L448 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2018-11-23 08:37:05,383 INFO L444 ceAbstractionStarter]: At program point L320(line 320) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,383 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2018-11-23 08:37:05,383 INFO L444 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,383 INFO L444 ceAbstractionStarter]: At program point L304(line 304) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,383 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2018-11-23 08:37:05,383 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2018-11-23 08:37:05,384 INFO L444 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0))) (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse4 (= |old(~s~0)| ~s~0))) (.cse1 (and (= ~s~0 ~NP~0) .cse4 (= ~pended~0 1))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-11-23 08:37:05,384 INFO L444 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,384 INFO L444 ceAbstractionStarter]: At program point L222(lines 221 420) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-11-23 08:37:05,384 INFO L448 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2018-11-23 08:37:05,384 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0)) (.cse5 (= ~s~0 ~SKIP1~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse4 .cse5 (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 (= ~pended~0 1) .cse5)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3)))) [2018-11-23 08:37:05,384 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-23 08:37:05,384 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2018-11-23 08:37:05,384 INFO L448 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L444 ceAbstractionStarter]: At program point L363(line 363) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L444 ceAbstractionStarter]: At program point L388(line 388) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L444 ceAbstractionStarter]: At program point L380(line 380) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2018-11-23 08:37:05,385 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2018-11-23 08:37:05,386 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2018-11-23 08:37:05,386 INFO L448 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2018-11-23 08:37:05,386 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (= |old(~s~0)| ~s~0)) (.cse5 (= 0 FloppyPnp_~ntStatus~0)) (.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and .cse1 .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4 .cse5) .cse6) (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4 .cse5) .cse6))) [2018-11-23 08:37:05,386 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2018-11-23 08:37:05,386 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2018-11-23 08:37:05,386 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2018-11-23 08:37:05,386 INFO L444 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-11-23 08:37:05,386 INFO L448 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2018-11-23 08:37:05,386 INFO L444 ceAbstractionStarter]: At program point L249(line 249) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-11-23 08:37:05,386 INFO L448 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2018-11-23 08:37:05,387 INFO L444 ceAbstractionStarter]: At program point L274(line 274) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 08:37:05,387 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2018-11-23 08:37:05,387 INFO L448 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2018-11-23 08:37:05,387 INFO L444 ceAbstractionStarter]: At program point L398(line 398) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,387 INFO L448 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2018-11-23 08:37:05,387 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2018-11-23 08:37:05,387 INFO L448 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2018-11-23 08:37:05,387 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (let ((.cse5 (< 0 ~MaximumInterfaceType~0)) (.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (and .cse0 .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse5 (and .cse0 .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4) .cse6))) [2018-11-23 08:37:05,387 INFO L444 ceAbstractionStarter]: At program point L704(line 704) 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-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L444 ceAbstractionStarter]: At program point L730(lines 729 777) 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)|)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~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-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2018-11-23 08:37:05,388 INFO L444 ceAbstractionStarter]: At program point L747(lines 746 774) 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-11-23 08:37:05,388 INFO L448 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2018-11-23 08:37:05,389 INFO L444 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (= main_~status~1 ~lowerDriverReturn~0)) (.cse8 (= 0 ~pended~0)) (.cse12 (= 0 main_~status~1)) (.cse11 (<= ~compRegistered~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~pended~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse12) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse12 .cse6 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse12 .cse11) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 08:37:05,389 INFO L448 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2018-11-23 08:37:05,389 INFO L448 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2018-11-23 08:37:05,389 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 748 773) no Hoare annotation was computed. [2018-11-23 08:37:05,389 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 748 773) no Hoare annotation was computed. [2018-11-23 08:37:05,389 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2018-11-23 08:37:05,389 INFO L448 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2018-11-23 08:37:05,389 INFO L444 ceAbstractionStarter]: At program point L715-2(lines 715 718) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= ~s~0 1)) (.cse5 (<= ~MPR3~0 6)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 6 ~MPR3~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= 0 main_~status~1)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (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)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (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-11-23 08:37:05,389 INFO L444 ceAbstractionStarter]: At program point L740(lines 739 775) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= 0 main_~status~1) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1)) (< 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-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2018-11-23 08:37:05,390 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) 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-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2018-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2018-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2018-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2018-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2018-11-23 08:37:05,390 INFO L444 ceAbstractionStarter]: At program point L825(line 825) 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-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2018-11-23 08:37:05,390 INFO L448 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2018-11-23 08:37:05,391 INFO L444 ceAbstractionStarter]: At program point L801(line 801) 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-11-23 08:37:05,391 INFO L444 ceAbstractionStarter]: At program point L735(lines 734 776) 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)|)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~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-11-23 08:37:05,391 INFO L444 ceAbstractionStarter]: At program point L810(lines 797 830) the Hoare annotation is: (let ((.cse5 (= ~DC~0 ~s~0)) (.cse6 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse1 (and .cse5 .cse6 .cse7 .cse8))) (let ((.cse3 (or .cse1 (and (= main_~status~1 ~lowerDriverReturn~0) .cse6 .cse7 .cse8 (<= ~compRegistered~0 0))))) (let ((.cse4 (= 0 main_~status~1)) (.cse2 (not (= 259 main_~status~1))) (.cse0 (and (<= (+ ~NP~0 2) ~SKIP1~0) (and .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0))))) (or (and .cse0 (<= (+ main_~status~1 1073741536) 0)) (and .cse1 .cse2) (not (= |old(~myStatus~0)| 0)) (and .cse3 .cse4) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse5 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (and (and (and (<= 1 ~NP~0) .cse0) (<= ~MPR3~0 6)) .cse2) (not (= |old(~compRegistered~0)| 0)) (and (<= ~SKIP2~0 ~s~0) .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse6 .cse7 .cse8 (= ~pended~0 1)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)))))) [2018-11-23 08:37:05,391 INFO L448 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2018-11-23 08:37:05,391 INFO L444 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse7 (= ~pended~0 1)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 main_~status~1)) (.cse10 (= ~IPC~0 ~s~0)) (.cse8 (<= ~compRegistered~0 0))) (or (and (and .cse0 .cse1 .cse2 .cse3) (not (= 259 main_~status~1))) (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 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse5 .cse6 (or (and .cse1 .cse2 .cse3 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse8))) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse7 .cse10) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse9 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (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 .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse8) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 08:37:05,391 INFO L448 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2018-11-23 08:37:05,391 INFO L444 ceAbstractionStarter]: At program point L819(line 819) 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-11-23 08:37:05,392 INFO L444 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (= main_~status~1 ~lowerDriverReturn~0)) (.cse8 (= 0 ~pended~0)) (.cse12 (= 0 main_~status~1)) (.cse11 (<= ~compRegistered~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~pended~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse8 .cse12) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse12 .cse6 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse12 .cse11) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 08:37:05,392 INFO L448 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2018-11-23 08:37:05,392 INFO L444 ceAbstractionStarter]: At program point L745(lines 744 774) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= ~s~0 1)) (.cse5 (<= ~MPR3~0 6)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 6 ~MPR3~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= 0 main_~status~1)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (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)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (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-11-23 08:37:05,392 INFO L444 ceAbstractionStarter]: At program point L1176(line 1176) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-23 08:37:05,392 INFO L448 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2018-11-23 08:37:05,392 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2018-11-23 08:37:05,392 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 1167 1180) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-23 08:37:05,392 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2018-11-23 08:37:05,393 INFO L444 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-11-23 08:37:05,393 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-23 08:37:05,393 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (= |old(~s~0)| ~s~0) (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1 (and (<= 1 ~s~0) (<= ~s~0 1))))) [2018-11-23 08:37:05,393 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-23 08:37:05,393 INFO L451 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2018-11-23 08:37:05,393 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-23 08:37:05,393 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2018-11-23 08:37:05,393 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2018-11-23 08:37:05,393 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L444 ceAbstractionStarter]: At program point L1088(lines 1087 1099) the Hoare annotation is: (let ((.cse31 (+ ~SKIP1~0 2)) (.cse29 (+ ~DC~0 5)) (.cse32 (+ ~DC~0 2)) (.cse30 (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not .cse30)) (.cse2 (< ~SKIP2~0 .cse32)) (.cse10 (< ~IPC~0 .cse29)) (.cse6 (< ~MPR1~0 .cse31)) (.cse24 (< ~compRegistered~0 1)) (.cse28 (<= 1 ~s~0))) (let ((.cse26 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse28 (<= ~s~0 ~NP~0) (<= .cse32 ~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))) (.cse1 (< 6 ~MPR3~0)) (.cse16 (or .cse0 (or .cse8 .cse2 .cse10) .cse6 .cse24)) (.cse19 (< |old(~setEventCalled~0)| 1)) (.cse17 (< ~NP~0 1)) (.cse20 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse22 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse5 (and .cse28 (<= ~s~0 1) .cse27)) (.cse15 (or .cse1 .cse16 .cse19 .cse17 .cse20 .cse3 .cse4 .cse21 .cse22)) (.cse7 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (= ~myStatus~0 0))) (.cse13 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse25 (and .cse26 .cse27)) (.cse23 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse14 .cse15) (or .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse20 .cse12 .cse21 .cse22) (or .cse5 .cse18 .cse14 .cse15) (or (< ~MPR3~0 (+ ~NP~0 5)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse2 .cse10) (or (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse22) .cse25 .cse18 .cse14) (or .cse13 .cse14 (or (and (= |old(~customIrp~0)| 1) .cse26 (= 0 ~customIrp~0)) .cse25) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse22))))))) [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L444 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~IPC~0 (+ ~DC~0 5))) (.cse0 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~compRegistered~0 1))) (let ((.cse5 (< 6 ~MPR3~0)) (.cse20 (or .cse4 (or .cse8 .cse2 .cse3) .cse0 .cse16)) (.cse15 (< |old(~setEventCalled~0)| 1)) (.cse21 (< ~NP~0 1)) (.cse22 (< ~MPR3~0 |old(~s~0)|)) (.cse6 (< ~MPR3~0 6)) (.cse7 (< 1 ~NP~0)) (.cse23 (< |old(~s~0)| ~MPR3~0)) (.cse17 (< 1 |old(~setEventCalled~0)|))) (let ((.cse1 (not (= ~compRegistered~0 0))) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse10 (< |old(~s~0)| 1)) (.cse18 (not (= ~myStatus~0 0))) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse12 (< 0 (+ ~myStatus~0 1073741637))) (.cse13 (< 0 ~MaximumInterfaceType~0)) (.cse19 (or .cse5 .cse20 .cse15 .cse21 .cse22 .cse6 .cse7 .cse23 .cse17))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse2 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse11) (or .cse12 .cse13 (or .cse5 .cse14 .cse2 .cse6 .cse7 .cse0 .cse15 .cse8 .cse16 .cse9 .cse3 .cse10 .cse17)) (or .cse18 .cse13 .cse19) (or (or .cse5 .cse14 .cse2 .cse6 .cse7 .cse0 .cse15 .cse8 .cse16 .cse9 .cse3 .cse10 .cse11 .cse17) .cse18 .cse13) (or .cse5 .cse20 .cse15 .cse21 .cse18 .cse22 .cse6 .cse7 .cse11 .cse23 .cse17) (or .cse12 .cse13 .cse19))))) [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1091 1098) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1091 1098) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2018-11-23 08:37:05,394 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2018-11-23 08:37:05,395 INFO L444 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~compRegistered~0 1))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse23 (or .cse17 (or .cse7 .cse2 .cse10) .cse5 .cse8)) (.cse6 (< |old(~setEventCalled~0)| 1)) (.cse24 (< ~NP~0 1)) (.cse25 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse26 (< |old(~s~0)| ~MPR3~0)) (.cse13 (< 1 |old(~setEventCalled~0)|)) (.cse18 (= |old(~customIrp~0)| ~customIrp~0)) (.cse20 (= |old(~s~0)| ~s~0))) (let ((.cse19 (not (= ~compRegistered~0 0))) (.cse16 (and .cse18 (<= 1 ~setEventCalled~0) .cse20 (<= ~setEventCalled~0 1))) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1)) (.cse14 (not (= ~myStatus~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse22 (< 0 (+ ~myStatus~0 1073741637))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse21 (or .cse0 .cse23 .cse6 .cse24 .cse25 .cse3 .cse4 .cse26 .cse13))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse3 .cse4 (and (<= 1 ~s~0) (<= ~s~0 1) .cse18) .cse5 .cse19 .cse7 .cse9 .cse10 .cse11 .cse12) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse5 .cse19 .cse20 .cse2 .cse10) (or .cse14 .cse15 .cse21) (or .cse22 .cse15 .cse16 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (or .cse0 .cse23 .cse6 .cse24 .cse14 .cse25 .cse3 .cse4 .cse12 .cse26 .cse13) (or .cse22 .cse15 .cse21))))) [2018-11-23 08:37:05,395 INFO L448 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2018-11-23 08:37:05,395 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse22 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~compRegistered~0 1))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse24 (or .cse22 (or .cse7 .cse2 .cse10) .cse5 .cse8)) (.cse6 (< |old(~setEventCalled~0)| 1)) (.cse25 (< ~NP~0 1)) (.cse26 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse27 (< |old(~s~0)| ~MPR3~0)) (.cse13 (< 1 |old(~setEventCalled~0)|)) (.cse23 (= |old(~customIrp~0)| ~customIrp~0)) (.cse28 (<= 1 ~setEventCalled~0)) (.cse18 (= |old(~s~0)| ~s~0)) (.cse29 (<= ~setEventCalled~0 1))) (let ((.cse17 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse19 (< 0 (+ ~myStatus~0 1073741637))) (.cse16 (and .cse23 .cse28 .cse18 .cse29)) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1)) (.cse14 (not (= ~myStatus~0 0))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse21 (or .cse0 .cse24 .cse6 .cse25 .cse26 .cse3 .cse4 .cse27 .cse13)) (.cse20 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse23 .cse28 .cse29))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse5 .cse17 .cse2 .cse18 .cse10) (or .cse19 .cse20 .cse15 .cse21) (or .cse22 .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse23) .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse24 .cse25 .cse14 .cse3 .cse4 .cse20 .cse6 .cse26 .cse12 .cse27 .cse13) (or .cse19 .cse15 .cse16 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (or .cse14 .cse15 .cse21 .cse20))))) [2018-11-23 08:37:05,396 INFO L444 ceAbstractionStarter]: At program point L1090(lines 1089 1099) the Hoare annotation is: (let ((.cse31 (+ ~SKIP1~0 2)) (.cse29 (+ ~DC~0 5)) (.cse32 (+ ~DC~0 2)) (.cse30 (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not .cse30)) (.cse2 (< ~SKIP2~0 .cse32)) (.cse10 (< ~IPC~0 .cse29)) (.cse6 (< ~MPR1~0 .cse31)) (.cse24 (< ~compRegistered~0 1)) (.cse28 (<= 1 ~s~0))) (let ((.cse26 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse28 (<= ~s~0 ~NP~0) (<= .cse32 ~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))) (.cse1 (< 6 ~MPR3~0)) (.cse16 (or .cse0 (or .cse8 .cse2 .cse10) .cse6 .cse24)) (.cse19 (< |old(~setEventCalled~0)| 1)) (.cse17 (< ~NP~0 1)) (.cse20 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse22 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse5 (and .cse28 (<= ~s~0 1) .cse27)) (.cse15 (or .cse1 .cse16 .cse19 .cse17 .cse20 .cse3 .cse4 .cse21 .cse22)) (.cse7 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (= ~myStatus~0 0))) (.cse13 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse25 (and .cse26 .cse27)) (.cse23 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse14 .cse15) (or .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse20 .cse12 .cse21 .cse22) (or .cse5 .cse18 .cse14 .cse15) (or (< ~MPR3~0 (+ ~NP~0 5)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse2 .cse10) (or (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse22) .cse25 .cse18 .cse14) (or .cse13 .cse14 (or (and (= |old(~customIrp~0)| 1) .cse26 (= 0 ~customIrp~0)) .cse25) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse22))))))) [2018-11-23 08:37:05,397 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1038 1051) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse4) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) .cse5 (< 1 ~NP~0) (< |old(~s~0)| 1)) (= |old(~s~0)| ~s~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse1 .cse0 .cse2 .cse5 .cse4))) [2018-11-23 08:37:05,397 INFO L444 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse0 (not (= 0 ~pended~0))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (= ~compRegistered~0 0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse0 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse1) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1)) (or .cse3 .cse4 .cse0) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse3 .cse4 .cse2 .cse1))) [2018-11-23 08:37:05,398 INFO L448 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2018-11-23 08:37:05,398 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2018-11-23 08:37:05,398 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2018-11-23 08:37:05,398 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2018-11-23 08:37:05,398 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2018-11-23 08:37:05,404 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (let ((.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4) .cse5) (or (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) .cse0 .cse5))) [2018-11-23 08:37:05,404 INFO L444 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) .cse5) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and (= |old(~myStatus~0)| ~myStatus~0) .cse1 .cse2 .cse3 .cse4) .cse5))) [2018-11-23 08:37:05,404 INFO L448 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2018-11-23 08:37:05,404 INFO L444 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,404 INFO L448 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2018-11-23 08:37:05,404 INFO L444 ceAbstractionStarter]: At program point L557(lines 557 559) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 08:37:05,404 INFO L448 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2018-11-23 08:37:05,405 INFO L444 ceAbstractionStarter]: At program point L549-2(lines 549 565) the Hoare annotation is: (let ((.cse0 (and (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,405 INFO L444 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,408 INFO L444 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (let ((.cse2 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (let ((.cse4 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (.cse5 (= |old(~customIrp~0)| ~customIrp~0))) (or (and (and .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse5) (and (<= FloppyStartDevice_~__cil_tmp42~0 259) (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse4 .cse5)))) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2) .cse3) (or (and .cse2 .cse1) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse3))) [2018-11-23 08:37:05,409 INFO L444 ceAbstractionStarter]: At program point L492(line 492) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L444 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (let ((.cse0 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2018-11-23 08:37:05,409 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L444 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L444 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (let ((.cse9 (<= ~MPR3~0 ~s~0)) (.cse10 (<= ~s~0 ~MPR3~0)) (.cse8 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (= |old(~s~0)| ~s~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse6 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse7 (<= ~setEventCalled~0 1)) (.cse11 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0))) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 (and .cse0 .cse4 .cse9 .cse10 .cse5 .cse6 .cse1 .cse2 .cse7) .cse11)) (let ((.cse12 (= 0 ~myStatus~0))) (or (and .cse4 .cse9 .cse10 .cse5 .cse12 .cse6 .cse1 .cse2 .cse7) (not (= |old(~myStatus~0)| 0)) .cse8 (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse11)))) [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2018-11-23 08:37:05,418 INFO L444 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,418 INFO L444 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2018-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2018-11-23 08:37:05,425 INFO L444 ceAbstractionStarter]: At program point L497(line 497) 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) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2018-11-23 08:37:05,425 INFO L451 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2018-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2018-11-23 08:37:05,425 INFO L451 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2018-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2018-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1135 1142) no Hoare annotation was computed. [2018-11-23 08:37:05,425 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2018-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1135 1142) no Hoare annotation was computed. [2018-11-23 08:37:05,425 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2018-11-23 08:37:05,426 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2018-11-23 08:37:05,426 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2018-11-23 08:37:05,426 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2018-11-23 08:37:05,426 INFO L451 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2018-11-23 08:37:05,426 INFO L451 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2018-11-23 08:37:05,426 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2018-11-23 08:37:05,426 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1113 1120) no Hoare annotation was computed. [2018-11-23 08:37:05,426 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1113 1120) no Hoare annotation was computed. [2018-11-23 08:37:05,426 INFO L448 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2018-11-23 08:37:05,435 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 853 860) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ ~s~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 ~s~0) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~s~0 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2))) [2018-11-23 08:37:05,436 INFO L451 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2018-11-23 08:37:05,436 INFO L451 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 853 860) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (let ((.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse1 (not (= ~myStatus~0 0)) .cse0 .cse2))) [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2018-11-23 08:37:05,436 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2018-11-23 08:37:05,437 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2018-11-23 08:37:05,437 INFO L444 ceAbstractionStarter]: At program point L989(lines 988 1011) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse7 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse12 (not (= ~myStatus~0 0))) (.cse8 (< 0 ~MaximumInterfaceType~0)) (.cse9 (or .cse10 .cse11 .cse13))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse7 .cse13 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6) (or .cse7 .cse12 .cse8 .cse9))))) [2018-11-23 08:37:05,441 INFO L444 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse11 (< 6 ~MPR3~0)) (.cse12 (or (or .cse5 .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse10) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse9 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse11 .cse12 .cse13)) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (not (= ~myStatus~0 0))) (.cse3 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 1 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse3 .cse2) (or .cse4 (not (= 1 ~pended~0)) .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse11 .cse12 .cse0 .cse13 .cse3 (not (= ~customIrp~0 0))))))) [2018-11-23 08:37:05,441 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2018-11-23 08:37:05,441 INFO L448 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2018-11-23 08:37:05,441 INFO L444 ceAbstractionStarter]: At program point L994(lines 993 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse10 .cse11 .cse13)) (.cse9 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse9 .cse13 (not (= ~customIrp~0 0))) (or .cse12 .cse7 .cse8 .cse9) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6))))) [2018-11-23 08:37:05,447 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse18 (+ ~DC~0 2)) (.cse16 (+ ~DC~0 5)) (.cse17 (= 0 ~pended~0)) (.cse19 (+ ~SKIP1~0 2))) (let ((.cse4 (< ~MPR1~0 .cse19)) (.cse6 (not .cse17)) (.cse7 (< ~IPC~0 .cse16)) (.cse3 (< ~SKIP2~0 .cse18))) (let ((.cse0 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse8 (< 6 ~MPR3~0)) (.cse9 (or (or .cse4 .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse3 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse11 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse13 (< 0 ~MaximumInterfaceType~0)) (.cse14 (or .cse8 .cse9 .cse11)) (.cse12 (and (<= ~s~0 1) (and (<= .cse0 ~SKIP1~0) (<= .cse16 ~IPC~0) (<= .cse15 ~MPR3~0) .cse17 (= ~s~0 ~NP~0) (<= .cse18 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0))) (.cse1 (< ~MPR3~0 .cse15)) (.cse5 (not (= ~compRegistered~0 0))) (.cse2 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 .cse0) .cse1 .cse2 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 (< |old(~s~0)| ~SKIP1~0) .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 (not (= ~customIrp~0 0)) .cse12) (or .cse10 .cse12 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse12) (or .cse1 (not (= 1 ~pended~0)) .cse4 .cse5 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3 .cse7)))))) [2018-11-23 08:37:05,447 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2018-11-23 08:37:05,447 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2018-11-23 08:37:05,447 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2018-11-23 08:37:05,447 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2018-11-23 08:37:05,447 INFO L444 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse31 (+ ~DC~0 2)) (.cse29 (+ ~DC~0 5)) (.cse30 (= 0 ~pended~0)) (.cse28 (+ ~SKIP1~0 2)) (.cse32 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse3 (= ~MPR1~0 ~s~0)) (.cse4 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse32) 3221225494))) (.cse5 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse6 (<= (+ .cse32 1) 0)) (.cse12 (+ ~NP~0 2)) (.cse8 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse16 (< ~MPR1~0 .cse28)) (.cse18 (not .cse30)) (.cse19 (< ~IPC~0 .cse29)) (.cse15 (< ~SKIP2~0 .cse31))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse1 (or (or .cse16 .cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse19) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse15 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse11 (< ~MPR3~0 6)) (.cse10 (and (let ((.cse23 (<= .cse12 ~SKIP1~0)) (.cse24 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~SKIP2~0))) (.cse25 (<= .cse28 ~MPR1~0)) (.cse26 (<= 1 ~compRegistered~0)) (.cse27 (= ~NP~0 |old(~s~0)|))) (or (and .cse23 .cse3 .cse24 .cse4 (= 0 IofCallDriver_~returnVal2~0) .cse25 .cse26 .cse5 .cse6 .cse27) (and .cse23 .cse3 .cse24 .cse4 .cse25 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse26 .cse5 .cse6 .cse27))) .cse8 .cse9))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse7 (= IofCallDriver_~returnVal2~0 259)) (.cse21 (< 0 ~MaximumInterfaceType~0)) (.cse20 (and .cse10 (<= ~MaximumInterfaceType~0 0))) (.cse22 (or .cse0 .cse1 .cse11)) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= ~compRegistered~0 0))) (.cse14 (= ~s~0 ~SKIP1~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 .cse12) .cse13 .cse14 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse16 (< |old(~s~0)| ~SKIP1~0) .cse17 .cse18 .cse19) (or .cse20 (and (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) .cse7) (< 0 (+ ~myStatus~0 1073741637)) .cse21 .cse22) (or .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9) .cse21 .cse20 .cse22) (or .cse13 (not (= 1 ~pended~0)) .cse16 .cse17 .cse14 (not (= ~SKIP1~0 |old(~s~0)|)) .cse15 .cse19)))))) [2018-11-23 08:37:05,454 INFO L444 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse18 (+ ~DC~0 2)) (.cse16 (+ ~DC~0 5)) (.cse17 (= 0 ~pended~0)) (.cse19 (+ ~SKIP1~0 2))) (let ((.cse9 (< ~MPR1~0 .cse19)) (.cse12 (not .cse17)) (.cse14 (< ~IPC~0 .cse16)) (.cse13 (< ~SKIP2~0 .cse18))) (let ((.cse7 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse0 (< 6 ~MPR3~0)) (.cse1 (or (or .cse9 .cse12 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse14) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse13 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse3 (< ~MPR3~0 6))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse5 (< 0 ~MaximumInterfaceType~0)) (.cse6 (or .cse0 .cse1 .cse3)) (.cse4 (and (<= ~s~0 1) (and (<= .cse7 ~SKIP1~0) (<= .cse16 ~IPC~0) (<= .cse15 ~MPR3~0) .cse17 (= ~s~0 ~NP~0) (<= .cse18 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0))) (.cse8 (< ~MPR3~0 .cse15)) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~customIrp~0 0)) .cse4) (or .cse2 .cse4 .cse5 .cse6) (or (< ~SKIP1~0 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse5 .cse6 .cse4) (or .cse8 (not (= 1 ~pended~0)) .cse9 .cse10 .cse11 .cse13 .cse14)))))) [2018-11-23 08:37:05,454 INFO L448 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2018-11-23 08:37:05,454 INFO L444 ceAbstractionStarter]: At program point L996(lines 995 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse10 .cse11 .cse13)) (.cse9 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse9 .cse13 (not (= ~customIrp~0 0))) (or .cse12 .cse7 .cse8 .cse9) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6))))) [2018-11-23 08:37:05,458 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 997 1009) no Hoare annotation was computed. [2018-11-23 08:37:05,458 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 997 1009) no Hoare annotation was computed. [2018-11-23 08:37:05,458 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2018-11-23 08:37:05,458 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2018-11-23 08:37:05,458 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2018-11-23 08:37:05,458 INFO L444 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse9 (< 6 ~MPR3~0)) (.cse10 (or (or .cse1 .cse4 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse5 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse11 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse9 .cse10 .cse12))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse5 .cse6) (or .cse11 .cse7 .cse8))))) [2018-11-23 08:37:05,458 INFO L448 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2018-11-23 08:37:05,459 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2018-11-23 08:37:05,459 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-11-23 08:37:05,459 INFO L444 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-23 08:37:05,459 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2018-11-23 08:37:05,459 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2018-11-23 08:37:05,459 INFO L444 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L444 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and .cse0 (<= (+ FlQueueIrpToThread_~status~0 1073741823) 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (and .cse0 (= FlQueueIrpToThread_~status~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1))) [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L444 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L444 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2018-11-23 08:37:05,463 INFO L448 ceAbstractionStarter]: For program point $Ultimate##38(lines 1400 1526) no Hoare annotation was computed. [2018-11-23 08:37:05,464 INFO L448 ceAbstractionStarter]: For program point $Ultimate##37(lines 1400 1526) no Hoare annotation was computed. [2018-11-23 08:37:05,465 INFO L444 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,465 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2018-11-23 08:37:05,466 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2018-11-23 08:37:05,466 INFO L444 ceAbstractionStarter]: At program point L1316(lines 1315 1549) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,466 INFO L444 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,466 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2018-11-23 08:37:05,466 INFO L444 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,466 INFO L448 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2018-11-23 08:37:05,466 INFO L444 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,466 INFO L448 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2018-11-23 08:37:05,466 INFO L444 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,466 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2018-11-23 08:37:05,466 INFO L448 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2018-11-23 08:37:05,466 INFO L444 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,466 INFO L444 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse2 (+ ~DC~0 2))) (let ((.cse0 (and (= 0 ~pended~0) .cse1 (<= .cse2 ~SKIP2~0)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= FloppyDeviceControl_~__cil_tmp91~0 FloppyDeviceControl_~ntStatus~3) .cse0) (and .cse1 (= ~pended~0 1)) (< ~SKIP2~0 .cse2) (< 1 ~NP~0) (and (<= (+ FloppyDeviceControl_~ntStatus~3 1073741811) 0) .cse0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)))) [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L444 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L444 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and .cse0 (= ~pended~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= 0 ~pended~0) .cse0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1))) [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L444 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2018-11-23 08:37:05,472 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L444 ceAbstractionStarter]: At program point L1321(lines 1320 1547) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L444 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2018-11-23 08:37:05,474 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L444 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L444 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2018-11-23 08:37:05,475 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2018-11-23 08:37:05,478 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2018-11-23 08:37:05,478 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2018-11-23 08:37:05,478 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2018-11-23 08:37:05,478 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:37:05,478 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-11-23 08:37:05,478 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:37:05,478 INFO L444 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L444 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L444 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2018-11-23 08:37:05,479 INFO L444 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (let ((.cse3 (<= 1 ~setEventCalled~0)) (.cse4 (= 259 FlFdcDeviceIo_~__cil_tmp11~0)) (.cse5 (<= ~setEventCalled~0 1))) (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse3 .cse4 .cse5))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) (and (<= 1 ~s~0) (<= ~s~0 1) .cse3 .cse4 .cse5) .cse1 .cse2)))) [2018-11-23 08:37:05,481 INFO L448 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-11-23 08:37:05,481 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2018-11-23 08:37:05,481 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-11-23 08:37:05,481 INFO L448 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2018-11-23 08:37:05,481 INFO L444 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (<= ~s~0 1) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse1)))) [2018-11-23 08:37:05,481 INFO L448 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2018-11-23 08:37:05,481 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2018-11-23 08:37:05,481 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2018-11-23 08:37:05,481 INFO L444 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:37:05,486 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-11-23 08:37:05,486 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L451 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2018-11-23 08:37:05,486 INFO L451 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 897 904) no Hoare annotation was computed. [2018-11-23 08:37:05,486 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2018-11-23 08:37:05,486 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2018-11-23 08:37:05,487 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 897 904) no Hoare annotation was computed. [2018-11-23 08:37:05,487 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2018-11-23 08:37:05,487 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2018-11-23 08:37:05,487 INFO L451 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2018-11-23 08:37:05,487 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2018-11-23 08:37:05,493 INFO L451 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2018-11-23 08:37:05,493 INFO L448 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2018-11-23 08:37:05,493 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 874 881) no Hoare annotation was computed. [2018-11-23 08:37:05,494 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 874 881) no Hoare annotation was computed. [2018-11-23 08:37:05,494 INFO L451 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2018-11-23 08:37:05,494 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2018-11-23 08:37:05,494 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2018-11-23 08:37:05,494 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2018-11-23 08:37:05,494 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1156 1163) no Hoare annotation was computed. [2018-11-23 08:37:05,494 INFO L451 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2018-11-23 08:37:05,494 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2018-11-23 08:37:05,494 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1156 1163) no Hoare annotation was computed. [2018-11-23 08:37:05,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:37:05 BoogieIcfgContainer [2018-11-23 08:37:05,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:37:05,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:37:05,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:37:05,552 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:37:05,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:33" (3/4) ... [2018-11-23 08:37:05,556 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 08:37:05,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-23 08:37:05,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 08:37:05,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-23 08:37:05,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 08:37:05,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-23 08:37:05,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-23 08:37:05,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-23 08:37:05,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-23 08:37:05,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-23 08:37:05,580 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2018-11-23 08:37:05,582 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2018-11-23 08:37:05,583 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 08:37:05,584 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 08:37:05,611 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 08:37:05,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 08:37:05,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((SKIP2 == s && SKIP1 + 2 <= MPR1) && (((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\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)) || !(\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-11-23 08:37:05,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && status + 1073741536 <= 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(myStatus) == 0)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || (((1 <= NP && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 08:37:05,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC == s && 0 == compRegistered) && pended == 1) || 0 < \old(myStatus) + 1073741637) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((((((DC == s && 0 == compRegistered) && pended == 1) || !(\old(myStatus) == 0)) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,614 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 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 08:37:05,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && 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)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-23 08:37:05,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && 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)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-23 08:37:05,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) [2018-11-23 08:37:05,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 1 < NP) || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-23 08:37:05,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(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)) || ((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5)) && (((((((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && ((((!(myStatus == 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && returnVal2 == 259) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-23 08:37:05,615 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 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 08:37:05,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || \old(s) == s) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled)) [2018-11-23 08:37:05,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-23 08:37:05,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-23 08:37:05,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 08:37:05,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || (((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\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))) || \old(MPR3) < \old(s)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 08:37:05,617 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-11-23 08:37:05,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-23 08:37:05,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-23 08:37:05,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-23 08:37:05,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-23 08:37:05,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-23 08:37:05,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-23 08:37:05,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && \old(s) == s)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-23 08:37:05,763 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a5c2badc-7708-435e-b2e0-88da341a0f1c/bin-2019/uautomizer/witness.graphml [2018-11-23 08:37:05,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:37:05,764 INFO L168 Benchmark]: Toolchain (without parser) took 33625.44 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 856.2 MB). Free memory was 956.6 MB in the beginning and 1.7 GB in the end (delta: -790.2 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:37:05,764 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:37:05,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:37:05,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:37:05,765 INFO L168 Benchmark]: Boogie Preprocessor took 53.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:37:05,765 INFO L168 Benchmark]: RCFGBuilder took 882.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.5 MB in the end (delta: 122.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:37:05,765 INFO L168 Benchmark]: TraceAbstraction took 32031.75 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 718.8 MB). Free memory was 997.5 MB in the beginning and 1.8 GB in the end (delta: -790.4 MB). Peak memory consumption was 854.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:37:05,766 INFO L168 Benchmark]: Witness Printer took 211.02 ms. Allocated memory is still 1.9 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:37:05,767 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 882.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.5 MB in the end (delta: 122.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32031.75 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 718.8 MB). Free memory was 997.5 MB in the beginning and 1.8 GB in the end (delta: -790.4 MB). Peak memory consumption was 854.7 MB. Max. memory is 11.5 GB. * Witness Printer took 211.02 ms. Allocated memory is still 1.9 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: 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: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\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))) || \old(MPR3) < \old(s)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || (((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 729]: 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 == pended && s == NP) && 0 == compRegistered) && 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: 938]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && status + 1073741536 <= 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(myStatus) == 0)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || (((1 <= NP && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && 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)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && \old(s) == s)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || \old(s) == s) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) - InvariantResult [Line: 746]: 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: 221]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(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)) || ((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5)) && (((((((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && ((((!(myStatus == 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && returnVal2 == 259) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((SKIP2 == s && SKIP1 + 2 <= MPR1) && (((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\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)) || !(\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: 915]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 936]: 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 == pended && s == NP) && 0 == compRegistered) && 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: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 1 < NP) || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 849]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && 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)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((DC == s && 0 == compRegistered) && pended == 1) || 0 < \old(myStatus) + 1073741637) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((((((DC == s && 0 == compRegistered) && pended == 1) || !(\old(myStatus) == 0)) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 415 locations, 1 error locations. SAFE Result, 31.9s OverallTime, 65 OverallIterations, 2 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 16.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25811 SDtfs, 11360 SDslu, 82257 SDs, 0 SdLazy, 10961 SolverSat, 2048 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 624 SyntacticMatches, 17 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=966occurred in iteration=19, 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.8s AutomataMinimizationTime, 65 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2114 PreInvPairs, 2425 NumberOfFragments, 19233 HoareAnnotationTreeSize, 2114 FomulaSimplifications, 221365 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 142 FomulaSimplificationsInter, 441516 FormulaSimplificationTreeSizeReductionInter, 14.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 5218 NumberOfCodeBlocks, 5218 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 5150 ConstructedInterpolants, 0 QuantifiedInterpolants, 832876 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3755 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 68 InterpolantComputations, 65 PerfectInterpolantSequences, 349/358 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...