./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/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_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/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-635dfa2 [2018-12-02 00:40:07,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:40:07,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:40:07,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:40:07,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:40:07,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:40:07,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:40:07,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:40:07,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:40:07,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:40:07,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:40:07,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:40:07,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:40:07,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:40:07,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:40:07,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:40:07,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:40:07,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:40:07,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:40:07,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:40:07,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:40:07,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:40:07,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:40:07,228 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:40:07,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:40:07,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:40:07,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:40:07,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:40:07,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:40:07,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:40:07,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:40:07,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:40:07,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:40:07,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:40:07,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:40:07,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:40:07,232 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 00:40:07,239 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:40:07,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:40:07,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:40:07,240 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 00:40:07,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 00:40:07,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 00:40:07,240 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 00:40:07,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 00:40:07,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 00:40:07,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:40:07,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 00:40:07,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:40:07,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:40:07,243 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_d701f30d-dedc-4f49-8f61-f05fee757cbb/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-12-02 00:40:07,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:40:07,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:40:07,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:40:07,269 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:40:07,269 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:40:07,270 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 00:40:07,305 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/data/5b89e61c8/bacd6bfe9a0b4c0eb7e217d1043ea92f/FLAG207e51f79 [2018-12-02 00:40:07,790 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:40:07,791 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 00:40:07,802 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/data/5b89e61c8/bacd6bfe9a0b4c0eb7e217d1043ea92f/FLAG207e51f79 [2018-12-02 00:40:08,290 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/data/5b89e61c8/bacd6bfe9a0b4c0eb7e217d1043ea92f [2018-12-02 00:40:08,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:40:08,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:40:08,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:40:08,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:40:08,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:40:08,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4b7748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08, skipping insertion in model container [2018-12-02 00:40:08,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:40:08,335 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:40:08,506 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:40:08,509 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:40:08,624 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:40:08,641 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:40:08,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08 WrapperNode [2018-12-02 00:40:08,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:40:08,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:40:08,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:40:08,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:40:08,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:40:08,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:40:08,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:40:08,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:40:08,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... [2018-12-02 00:40:08,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:40:08,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:40:08,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:40:08,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:40:08,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:40:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-12-02 00:40:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-12-02 00:40:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-02 00:40:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-02 00:40:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-12-02 00:40:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-12-02 00:40:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-12-02 00:40:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-12-02 00:40:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 00:40:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 00:40:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-12-02 00:40:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-12-02 00:40:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-02 00:40:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-02 00:40:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-12-02 00:40:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-12-02 00:40:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-02 00:40:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-02 00:40:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-02 00:40:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-02 00:40:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-12-02 00:40:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-12-02 00:40:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-12-02 00:40:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-12-02 00:40:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-12-02 00:40:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-12-02 00:40:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-02 00:40:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-02 00:40:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-02 00:40:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-02 00:40:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-02 00:40:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-02 00:40:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-02 00:40:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-02 00:40:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-02 00:40:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-02 00:40:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:40:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:40:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-12-02 00:40:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-12-02 00:40:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-12-02 00:40:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-12-02 00:40:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-02 00:40:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-02 00:40:08,870 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:08,870 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:08,908 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:08,909 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:08,922 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:08,922 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,007 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,007 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,067 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,067 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,125 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,125 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,129 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,129 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,133 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,133 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,145 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,145 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,178 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,178 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,263 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,263 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,267 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,267 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,271 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 00:40:09,271 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 00:40:09,283 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:40:09,283 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 00:40:09,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:09 BoogieIcfgContainer [2018-12-02 00:40:09,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:40:09,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 00:40:09,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 00:40:09,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 00:40:09,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:40:08" (1/3) ... [2018-12-02 00:40:09,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44583c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:40:09, skipping insertion in model container [2018-12-02 00:40:09,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:08" (2/3) ... [2018-12-02 00:40:09,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44583c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:40:09, skipping insertion in model container [2018-12-02 00:40:09,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:09" (3/3) ... [2018-12-02 00:40:09,289 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 00:40:09,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 00:40:09,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 00:40:09,318 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 00:40:09,338 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 00:40:09,338 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 00:40:09,338 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 00:40:09,338 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 00:40:09,338 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:40:09,338 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:40:09,338 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 00:40:09,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:40:09,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 00:40:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2018-12-02 00:40:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 00:40:09,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:09,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] [2018-12-02 00:40:09,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:09,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash -688252531, now seen corresponding path program 1 times [2018-12-02 00:40:09,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:09,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:09,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:09,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:09,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:09,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:09,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:09,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:09,518 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2018-12-02 00:40:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:09,596 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2018-12-02 00:40:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:09,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 00:40:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:09,611 INFO L225 Difference]: With dead ends: 624 [2018-12-02 00:40:09,611 INFO L226 Difference]: Without dead ends: 380 [2018-12-02 00:40:09,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-02 00:40:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-12-02 00:40:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-02 00:40:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2018-12-02 00:40:09,659 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2018-12-02 00:40:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:09,659 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2018-12-02 00:40:09,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2018-12-02 00:40:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 00:40:09,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:09,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:09,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:09,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:09,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1177754650, now seen corresponding path program 1 times [2018-12-02 00:40:09,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:09,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:09,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:09,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:09,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:09,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:09,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:09,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:09,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:09,746 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2018-12-02 00:40:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:09,861 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2018-12-02 00:40:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:09,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 00:40:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:09,864 INFO L225 Difference]: With dead ends: 699 [2018-12-02 00:40:09,864 INFO L226 Difference]: Without dead ends: 536 [2018-12-02 00:40:09,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-12-02 00:40:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2018-12-02 00:40:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-12-02 00:40:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2018-12-02 00:40:09,890 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2018-12-02 00:40:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:09,890 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2018-12-02 00:40:09,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2018-12-02 00:40:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 00:40:09,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:09,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:09,891 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:09,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1821616786, now seen corresponding path program 1 times [2018-12-02 00:40:09,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:09,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:09,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:09,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:09,953 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2018-12-02 00:40:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:09,981 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2018-12-02 00:40:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:09,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 00:40:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:09,984 INFO L225 Difference]: With dead ends: 642 [2018-12-02 00:40:09,984 INFO L226 Difference]: Without dead ends: 623 [2018-12-02 00:40:09,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-12-02 00:40:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2018-12-02 00:40:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-12-02 00:40:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2018-12-02 00:40:10,005 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2018-12-02 00:40:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:10,006 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2018-12-02 00:40:10,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2018-12-02 00:40:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 00:40:10,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:10,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:10,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:10,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1105627836, now seen corresponding path program 1 times [2018-12-02 00:40:10,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:10,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:10,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:10,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:10,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:10,052 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2018-12-02 00:40:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:10,079 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2018-12-02 00:40:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:10,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 00:40:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:10,081 INFO L225 Difference]: With dead ends: 1080 [2018-12-02 00:40:10,081 INFO L226 Difference]: Without dead ends: 788 [2018-12-02 00:40:10,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-12-02 00:40:10,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2018-12-02 00:40:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-02 00:40:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2018-12-02 00:40:10,107 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2018-12-02 00:40:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:10,107 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2018-12-02 00:40:10,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2018-12-02 00:40:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 00:40:10,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:10,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:10,108 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:10,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:10,109 INFO L82 PathProgramCache]: Analyzing trace with hash 149710402, now seen corresponding path program 1 times [2018-12-02 00:40:10,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:10,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:10,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:10,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:10,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:10,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:10,132 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2018-12-02 00:40:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:10,197 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2018-12-02 00:40:10,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:10,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-02 00:40:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:10,200 INFO L225 Difference]: With dead ends: 795 [2018-12-02 00:40:10,200 INFO L226 Difference]: Without dead ends: 790 [2018-12-02 00:40:10,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-02 00:40:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2018-12-02 00:40:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-12-02 00:40:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2018-12-02 00:40:10,224 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2018-12-02 00:40:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:10,224 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2018-12-02 00:40:10,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2018-12-02 00:40:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 00:40:10,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:10,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:10,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:10,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1382897701, now seen corresponding path program 1 times [2018-12-02 00:40:10,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:10,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:10,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:10,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:10,273 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2018-12-02 00:40:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:10,355 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2018-12-02 00:40:10,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:10,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-02 00:40:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:10,359 INFO L225 Difference]: With dead ends: 803 [2018-12-02 00:40:10,359 INFO L226 Difference]: Without dead ends: 800 [2018-12-02 00:40:10,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-02 00:40:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2018-12-02 00:40:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-12-02 00:40:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2018-12-02 00:40:10,384 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2018-12-02 00:40:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:10,384 INFO L480 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2018-12-02 00:40:10,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2018-12-02 00:40:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 00:40:10,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:10,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:10,385 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:10,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash -91658760, now seen corresponding path program 1 times [2018-12-02 00:40:10,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:10,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:10,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:10,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:10,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:10,424 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2018-12-02 00:40:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:10,469 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2018-12-02 00:40:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:10,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-02 00:40:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:10,472 INFO L225 Difference]: With dead ends: 812 [2018-12-02 00:40:10,473 INFO L226 Difference]: Without dead ends: 797 [2018-12-02 00:40:10,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-12-02 00:40:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2018-12-02 00:40:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-12-02 00:40:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2018-12-02 00:40:10,502 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2018-12-02 00:40:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:10,502 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2018-12-02 00:40:10,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2018-12-02 00:40:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 00:40:10,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:10,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:10,503 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:10,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:10,504 INFO L82 PathProgramCache]: Analyzing trace with hash 797704003, now seen corresponding path program 1 times [2018-12-02 00:40:10,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:10,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:10,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:10,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:10,550 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2018-12-02 00:40:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:10,588 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2018-12-02 00:40:10,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:10,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-02 00:40:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:10,592 INFO L225 Difference]: With dead ends: 810 [2018-12-02 00:40:10,592 INFO L226 Difference]: Without dead ends: 790 [2018-12-02 00:40:10,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-02 00:40:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-02 00:40:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-02 00:40:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-12-02 00:40:10,620 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2018-12-02 00:40:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:10,620 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-12-02 00:40:10,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-12-02 00:40:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 00:40:10,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:10,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:10,621 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:10,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash 354660221, now seen corresponding path program 1 times [2018-12-02 00:40:10,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:10,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:10,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:10,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:10,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:10,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:10,676 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 5 states. [2018-12-02 00:40:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:10,913 INFO L93 Difference]: Finished difference Result 798 states and 1072 transitions. [2018-12-02 00:40:10,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:10,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-02 00:40:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:10,916 INFO L225 Difference]: With dead ends: 798 [2018-12-02 00:40:10,916 INFO L226 Difference]: Without dead ends: 792 [2018-12-02 00:40:10,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-12-02 00:40:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2018-12-02 00:40:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-02 00:40:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1065 transitions. [2018-12-02 00:40:10,935 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1065 transitions. Word has length 43 [2018-12-02 00:40:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:10,935 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1065 transitions. [2018-12-02 00:40:10,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1065 transitions. [2018-12-02 00:40:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 00:40:10,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:10,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:10,936 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:10,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash 472733380, now seen corresponding path program 1 times [2018-12-02 00:40:10,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:10,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:10,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:10,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:10,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:10,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:40:10,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:40:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:40:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:40:10,969 INFO L87 Difference]: Start difference. First operand 790 states and 1065 transitions. Second operand 4 states. [2018-12-02 00:40:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:11,017 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2018-12-02 00:40:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:40:11,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-02 00:40:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:11,020 INFO L225 Difference]: With dead ends: 818 [2018-12-02 00:40:11,020 INFO L226 Difference]: Without dead ends: 796 [2018-12-02 00:40:11,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-12-02 00:40:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 792. [2018-12-02 00:40:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-12-02 00:40:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1067 transitions. [2018-12-02 00:40:11,047 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1067 transitions. Word has length 42 [2018-12-02 00:40:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:11,047 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1067 transitions. [2018-12-02 00:40:11,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:40:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1067 transitions. [2018-12-02 00:40:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 00:40:11,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:11,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] [2018-12-02 00:40:11,049 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:11,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1725637380, now seen corresponding path program 1 times [2018-12-02 00:40:11,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:11,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:11,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:11,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:11,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:11,073 INFO L87 Difference]: Start difference. First operand 792 states and 1067 transitions. Second operand 3 states. [2018-12-02 00:40:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:11,148 INFO L93 Difference]: Finished difference Result 1170 states and 1590 transitions. [2018-12-02 00:40:11,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:11,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-02 00:40:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:11,151 INFO L225 Difference]: With dead ends: 1170 [2018-12-02 00:40:11,151 INFO L226 Difference]: Without dead ends: 1167 [2018-12-02 00:40:11,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-12-02 00:40:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 915. [2018-12-02 00:40:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-12-02 00:40:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2018-12-02 00:40:11,177 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 44 [2018-12-02 00:40:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:11,177 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2018-12-02 00:40:11,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2018-12-02 00:40:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 00:40:11,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:11,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:11,178 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:11,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:11,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1543911893, now seen corresponding path program 1 times [2018-12-02 00:40:11,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:11,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:11,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:11,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:11,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:11,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:11,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:11,213 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 5 states. [2018-12-02 00:40:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:11,467 INFO L93 Difference]: Finished difference Result 923 states and 1242 transitions. [2018-12-02 00:40:11,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:11,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 00:40:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:11,471 INFO L225 Difference]: With dead ends: 923 [2018-12-02 00:40:11,472 INFO L226 Difference]: Without dead ends: 917 [2018-12-02 00:40:11,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-02 00:40:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 915. [2018-12-02 00:40:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-12-02 00:40:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-12-02 00:40:11,514 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 44 [2018-12-02 00:40:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:11,514 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-12-02 00:40:11,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-12-02 00:40:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 00:40:11,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:11,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:11,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:11,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash 381844807, now seen corresponding path program 1 times [2018-12-02 00:40:11,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:11,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:11,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:11,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:40:11,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:40:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:40:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:40:11,548 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 4 states. [2018-12-02 00:40:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:11,625 INFO L93 Difference]: Finished difference Result 943 states and 1268 transitions. [2018-12-02 00:40:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:40:11,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-02 00:40:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:11,628 INFO L225 Difference]: With dead ends: 943 [2018-12-02 00:40:11,628 INFO L226 Difference]: Without dead ends: 921 [2018-12-02 00:40:11,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-12-02 00:40:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2018-12-02 00:40:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-12-02 00:40:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-12-02 00:40:11,661 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 43 [2018-12-02 00:40:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:11,662 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-12-02 00:40:11,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:40:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-12-02 00:40:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 00:40:11,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:11,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:11,663 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:11,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:11,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1717093558, now seen corresponding path program 1 times [2018-12-02 00:40:11,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:11,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:11,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:11,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:11,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:11,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:11,718 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 5 states. [2018-12-02 00:40:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:12,133 INFO L93 Difference]: Finished difference Result 1639 states and 2181 transitions. [2018-12-02 00:40:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:12,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 00:40:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:12,138 INFO L225 Difference]: With dead ends: 1639 [2018-12-02 00:40:12,138 INFO L226 Difference]: Without dead ends: 1088 [2018-12-02 00:40:12,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-12-02 00:40:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 906. [2018-12-02 00:40:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-12-02 00:40:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2018-12-02 00:40:12,180 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 45 [2018-12-02 00:40:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:12,181 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2018-12-02 00:40:12,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2018-12-02 00:40:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 00:40:12,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:12,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:12,182 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:12,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash 700175398, now seen corresponding path program 1 times [2018-12-02 00:40:12,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:12,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:12,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:12,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:12,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:12,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:12,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:12,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:12,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:12,214 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2018-12-02 00:40:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:12,260 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2018-12-02 00:40:12,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:12,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 00:40:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:12,263 INFO L225 Difference]: With dead ends: 922 [2018-12-02 00:40:12,263 INFO L226 Difference]: Without dead ends: 904 [2018-12-02 00:40:12,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-02 00:40:12,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-02 00:40:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-02 00:40:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2018-12-02 00:40:12,307 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2018-12-02 00:40:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:12,307 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2018-12-02 00:40:12,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2018-12-02 00:40:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 00:40:12,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:12,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:12,309 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:12,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash -47081320, now seen corresponding path program 1 times [2018-12-02 00:40:12,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:12,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:12,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:12,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:12,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:12,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:12,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:12,341 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2018-12-02 00:40:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:12,380 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2018-12-02 00:40:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:12,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 00:40:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:12,383 INFO L225 Difference]: With dead ends: 944 [2018-12-02 00:40:12,383 INFO L226 Difference]: Without dead ends: 868 [2018-12-02 00:40:12,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-12-02 00:40:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2018-12-02 00:40:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-02 00:40:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2018-12-02 00:40:12,420 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2018-12-02 00:40:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:12,420 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2018-12-02 00:40:12,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2018-12-02 00:40:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 00:40:12,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:12,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:12,422 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:12,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1679726262, now seen corresponding path program 1 times [2018-12-02 00:40:12,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:12,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:12,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:12,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:12,458 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2018-12-02 00:40:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:12,499 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2018-12-02 00:40:12,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:12,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 00:40:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:12,502 INFO L225 Difference]: With dead ends: 881 [2018-12-02 00:40:12,502 INFO L226 Difference]: Without dead ends: 863 [2018-12-02 00:40:12,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-12-02 00:40:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-12-02 00:40:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-12-02 00:40:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2018-12-02 00:40:12,533 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2018-12-02 00:40:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:12,533 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2018-12-02 00:40:12,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2018-12-02 00:40:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 00:40:12,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:12,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:12,534 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:12,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1637294242, now seen corresponding path program 1 times [2018-12-02 00:40:12,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:12,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:12,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:12,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:12,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:12,582 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 6 states. [2018-12-02 00:40:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:12,658 INFO L93 Difference]: Finished difference Result 883 states and 1175 transitions. [2018-12-02 00:40:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:12,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-02 00:40:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:12,661 INFO L225 Difference]: With dead ends: 883 [2018-12-02 00:40:12,661 INFO L226 Difference]: Without dead ends: 863 [2018-12-02 00:40:12,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-12-02 00:40:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-12-02 00:40:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-12-02 00:40:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1143 transitions. [2018-12-02 00:40:12,697 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1143 transitions. Word has length 50 [2018-12-02 00:40:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:12,698 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1143 transitions. [2018-12-02 00:40:12,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1143 transitions. [2018-12-02 00:40:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 00:40:12,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:12,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:12,699 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:12,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1826385380, now seen corresponding path program 1 times [2018-12-02 00:40:12,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:12,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:12,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:12,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:12,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:12,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:12,720 INFO L87 Difference]: Start difference. First operand 863 states and 1143 transitions. Second operand 3 states. [2018-12-02 00:40:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:12,813 INFO L93 Difference]: Finished difference Result 1180 states and 1584 transitions. [2018-12-02 00:40:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:12,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 00:40:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:12,816 INFO L225 Difference]: With dead ends: 1180 [2018-12-02 00:40:12,817 INFO L226 Difference]: Without dead ends: 1153 [2018-12-02 00:40:12,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-12-02 00:40:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 966. [2018-12-02 00:40:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-12-02 00:40:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1285 transitions. [2018-12-02 00:40:12,863 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1285 transitions. Word has length 50 [2018-12-02 00:40:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:12,863 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 1285 transitions. [2018-12-02 00:40:12,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1285 transitions. [2018-12-02 00:40:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 00:40:12,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:12,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:12,865 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:12,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -273092308, now seen corresponding path program 1 times [2018-12-02 00:40:12,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:12,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:12,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:40:12,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:40:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:40:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:40:12,907 INFO L87 Difference]: Start difference. First operand 966 states and 1285 transitions. Second operand 4 states. [2018-12-02 00:40:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:13,068 INFO L93 Difference]: Finished difference Result 1059 states and 1376 transitions. [2018-12-02 00:40:13,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:40:13,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-12-02 00:40:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:13,069 INFO L225 Difference]: With dead ends: 1059 [2018-12-02 00:40:13,069 INFO L226 Difference]: Without dead ends: 659 [2018-12-02 00:40:13,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:40:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-02 00:40:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 622. [2018-12-02 00:40:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-12-02 00:40:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2018-12-02 00:40:13,089 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 52 [2018-12-02 00:40:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:13,089 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2018-12-02 00:40:13,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:40:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2018-12-02 00:40:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 00:40:13,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:13,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:13,090 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:13,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash 998036193, now seen corresponding path program 1 times [2018-12-02 00:40:13,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:13,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:13,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:13,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:40:13,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:40:13,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:40:13,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:13,122 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2018-12-02 00:40:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:13,197 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2018-12-02 00:40:13,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:40:13,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-02 00:40:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:13,200 INFO L225 Difference]: With dead ends: 661 [2018-12-02 00:40:13,200 INFO L226 Difference]: Without dead ends: 612 [2018-12-02 00:40:13,200 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-12-02 00:40:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-02 00:40:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2018-12-02 00:40:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-02 00:40:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-12-02 00:40:13,219 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2018-12-02 00:40:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:13,219 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-12-02 00:40:13,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:40:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-12-02 00:40:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 00:40:13,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:13,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:13,220 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:13,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1800502866, now seen corresponding path program 1 times [2018-12-02 00:40:13,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:13,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:13,254 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2018-12-02 00:40:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:13,302 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2018-12-02 00:40:13,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:13,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-02 00:40:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:13,304 INFO L225 Difference]: With dead ends: 637 [2018-12-02 00:40:13,304 INFO L226 Difference]: Without dead ends: 612 [2018-12-02 00:40:13,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-02 00:40:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-12-02 00:40:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-02 00:40:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2018-12-02 00:40:13,334 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2018-12-02 00:40:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:13,334 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2018-12-02 00:40:13,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2018-12-02 00:40:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 00:40:13,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:13,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:13,336 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:13,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:13,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1235297599, now seen corresponding path program 1 times [2018-12-02 00:40:13,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:13,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:13,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:13,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:13,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:13,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:40:13,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:40:13,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:40:13,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:40:13,384 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2018-12-02 00:40:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:13,496 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2018-12-02 00:40:13,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:40:13,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-12-02 00:40:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:13,498 INFO L225 Difference]: With dead ends: 642 [2018-12-02 00:40:13,498 INFO L226 Difference]: Without dead ends: 638 [2018-12-02 00:40:13,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-12-02 00:40:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2018-12-02 00:40:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-12-02 00:40:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2018-12-02 00:40:13,517 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2018-12-02 00:40:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:13,518 INFO L480 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2018-12-02 00:40:13,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:40:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2018-12-02 00:40:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 00:40:13,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:13,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:13,519 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:13,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1235020769, now seen corresponding path program 1 times [2018-12-02 00:40:13,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:13,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:13,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:13,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:40:13,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:40:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:40:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:40:13,556 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2018-12-02 00:40:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:13,621 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2018-12-02 00:40:13,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:40:13,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-12-02 00:40:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:13,624 INFO L225 Difference]: With dead ends: 1024 [2018-12-02 00:40:13,624 INFO L226 Difference]: Without dead ends: 670 [2018-12-02 00:40:13,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:40:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-02 00:40:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-12-02 00:40:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-12-02 00:40:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2018-12-02 00:40:13,653 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2018-12-02 00:40:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:13,653 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2018-12-02 00:40:13,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:40:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2018-12-02 00:40:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 00:40:13,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:13,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:13,654 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:13,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash -203655125, now seen corresponding path program 1 times [2018-12-02 00:40:13,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:13,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:13,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:40:13,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:40:13,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:40:13,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:13,689 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 7 states. [2018-12-02 00:40:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:14,155 INFO L93 Difference]: Finished difference Result 805 states and 1032 transitions. [2018-12-02 00:40:14,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:40:14,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 00:40:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:14,157 INFO L225 Difference]: With dead ends: 805 [2018-12-02 00:40:14,157 INFO L226 Difference]: Without dead ends: 708 [2018-12-02 00:40:14,157 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-12-02 00:40:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-12-02 00:40:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 680. [2018-12-02 00:40:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-02 00:40:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 873 transitions. [2018-12-02 00:40:14,180 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 873 transitions. Word has length 52 [2018-12-02 00:40:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:14,181 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 873 transitions. [2018-12-02 00:40:14,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:40:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 873 transitions. [2018-12-02 00:40:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 00:40:14,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:14,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:14,182 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:14,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:14,182 INFO L82 PathProgramCache]: Analyzing trace with hash -60375767, now seen corresponding path program 1 times [2018-12-02 00:40:14,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:14,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:14,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:14,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:14,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:14,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:14,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:14,205 INFO L87 Difference]: Start difference. First operand 680 states and 873 transitions. Second operand 3 states. [2018-12-02 00:40:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:14,305 INFO L93 Difference]: Finished difference Result 838 states and 1091 transitions. [2018-12-02 00:40:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:14,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 00:40:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:14,307 INFO L225 Difference]: With dead ends: 838 [2018-12-02 00:40:14,307 INFO L226 Difference]: Without dead ends: 765 [2018-12-02 00:40:14,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-12-02 00:40:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 653. [2018-12-02 00:40:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-12-02 00:40:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 852 transitions. [2018-12-02 00:40:14,333 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 852 transitions. Word has length 52 [2018-12-02 00:40:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:14,333 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 852 transitions. [2018-12-02 00:40:14,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 852 transitions. [2018-12-02 00:40:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 00:40:14,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:14,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:14,334 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:14,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2114998175, now seen corresponding path program 1 times [2018-12-02 00:40:14,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:14,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:14,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:14,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:14,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:14,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:14,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:14,393 INFO L87 Difference]: Start difference. First operand 653 states and 852 transitions. Second operand 9 states. [2018-12-02 00:40:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:15,259 INFO L93 Difference]: Finished difference Result 850 states and 1093 transitions. [2018-12-02 00:40:15,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 00:40:15,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-12-02 00:40:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:15,260 INFO L225 Difference]: With dead ends: 850 [2018-12-02 00:40:15,261 INFO L226 Difference]: Without dead ends: 783 [2018-12-02 00:40:15,261 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-12-02 00:40:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-02 00:40:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 620. [2018-12-02 00:40:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-12-02 00:40:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 789 transitions. [2018-12-02 00:40:15,285 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 789 transitions. Word has length 52 [2018-12-02 00:40:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:15,285 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 789 transitions. [2018-12-02 00:40:15,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 789 transitions. [2018-12-02 00:40:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 00:40:15,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:15,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:15,286 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:15,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1870270086, now seen corresponding path program 1 times [2018-12-02 00:40:15,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:15,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:15,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:15,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:15,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:15,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:15,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:15,314 INFO L87 Difference]: Start difference. First operand 620 states and 789 transitions. Second operand 5 states. [2018-12-02 00:40:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:15,603 INFO L93 Difference]: Finished difference Result 767 states and 997 transitions. [2018-12-02 00:40:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:15,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 00:40:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:15,606 INFO L225 Difference]: With dead ends: 767 [2018-12-02 00:40:15,606 INFO L226 Difference]: Without dead ends: 749 [2018-12-02 00:40:15,606 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-12-02 00:40:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-02 00:40:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 603. [2018-12-02 00:40:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-12-02 00:40:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 762 transitions. [2018-12-02 00:40:15,647 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 762 transitions. Word has length 54 [2018-12-02 00:40:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:15,648 INFO L480 AbstractCegarLoop]: Abstraction has 603 states and 762 transitions. [2018-12-02 00:40:15,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 762 transitions. [2018-12-02 00:40:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 00:40:15,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:15,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:15,649 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:15,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:15,649 INFO L82 PathProgramCache]: Analyzing trace with hash -936674225, now seen corresponding path program 1 times [2018-12-02 00:40:15,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:15,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:15,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:15,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:40:15,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:40:15,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:40:15,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:40:15,695 INFO L87 Difference]: Start difference. First operand 603 states and 762 transitions. Second operand 8 states. [2018-12-02 00:40:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:15,760 INFO L93 Difference]: Finished difference Result 616 states and 774 transitions. [2018-12-02 00:40:15,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:40:15,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-12-02 00:40:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:15,762 INFO L225 Difference]: With dead ends: 616 [2018-12-02 00:40:15,762 INFO L226 Difference]: Without dead ends: 588 [2018-12-02 00:40:15,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-12-02 00:40:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2018-12-02 00:40:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-12-02 00:40:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 743 transitions. [2018-12-02 00:40:15,800 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 743 transitions. Word has length 55 [2018-12-02 00:40:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:15,800 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 743 transitions. [2018-12-02 00:40:15,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:40:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 743 transitions. [2018-12-02 00:40:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 00:40:15,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:15,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:15,801 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:15,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash -492692256, now seen corresponding path program 1 times [2018-12-02 00:40:15,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:15,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:15,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:15,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:15,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:15,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:15,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:15,831 INFO L87 Difference]: Start difference. First operand 588 states and 743 transitions. Second operand 3 states. [2018-12-02 00:40:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:15,903 INFO L93 Difference]: Finished difference Result 896 states and 1142 transitions. [2018-12-02 00:40:15,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:15,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-02 00:40:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:15,906 INFO L225 Difference]: With dead ends: 896 [2018-12-02 00:40:15,906 INFO L226 Difference]: Without dead ends: 587 [2018-12-02 00:40:15,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-12-02 00:40:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-12-02 00:40:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-12-02 00:40:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-12-02 00:40:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 739 transitions. [2018-12-02 00:40:15,956 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 739 transitions. Word has length 58 [2018-12-02 00:40:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:15,956 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 739 transitions. [2018-12-02 00:40:15,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 739 transitions. [2018-12-02 00:40:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 00:40:15,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:15,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:15,958 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:15,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:15,958 INFO L82 PathProgramCache]: Analyzing trace with hash 331311930, now seen corresponding path program 1 times [2018-12-02 00:40:15,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:15,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:15,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:15,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:16,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:16,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:16,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:16,035 INFO L87 Difference]: Start difference. First operand 587 states and 739 transitions. Second operand 5 states. [2018-12-02 00:40:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:16,089 INFO L93 Difference]: Finished difference Result 846 states and 1074 transitions. [2018-12-02 00:40:16,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:16,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-02 00:40:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:16,091 INFO L225 Difference]: With dead ends: 846 [2018-12-02 00:40:16,091 INFO L226 Difference]: Without dead ends: 538 [2018-12-02 00:40:16,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-02 00:40:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-12-02 00:40:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-02 00:40:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 671 transitions. [2018-12-02 00:40:16,135 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 671 transitions. Word has length 64 [2018-12-02 00:40:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:16,136 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 671 transitions. [2018-12-02 00:40:16,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 671 transitions. [2018-12-02 00:40:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 00:40:16,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:16,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:16,137 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 800339537, now seen corresponding path program 1 times [2018-12-02 00:40:16,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:16,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:16,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:40:16,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:40:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:40:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:40:16,183 INFO L87 Difference]: Start difference. First operand 538 states and 671 transitions. Second operand 8 states. [2018-12-02 00:40:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:16,287 INFO L93 Difference]: Finished difference Result 552 states and 684 transitions. [2018-12-02 00:40:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:40:16,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-02 00:40:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:16,289 INFO L225 Difference]: With dead ends: 552 [2018-12-02 00:40:16,289 INFO L226 Difference]: Without dead ends: 534 [2018-12-02 00:40:16,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-02 00:40:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-12-02 00:40:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-12-02 00:40:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 665 transitions. [2018-12-02 00:40:16,327 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 665 transitions. Word has length 58 [2018-12-02 00:40:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:16,327 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 665 transitions. [2018-12-02 00:40:16,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:40:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 665 transitions. [2018-12-02 00:40:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 00:40:16,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:16,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:16,328 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:16,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash -247744455, now seen corresponding path program 1 times [2018-12-02 00:40:16,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:16,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:16,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:16,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:16,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:16,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:16,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:16,362 INFO L87 Difference]: Start difference. First operand 534 states and 665 transitions. Second operand 6 states. [2018-12-02 00:40:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:16,425 INFO L93 Difference]: Finished difference Result 553 states and 684 transitions. [2018-12-02 00:40:16,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:16,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 00:40:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:16,427 INFO L225 Difference]: With dead ends: 553 [2018-12-02 00:40:16,427 INFO L226 Difference]: Without dead ends: 529 [2018-12-02 00:40:16,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-02 00:40:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-12-02 00:40:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-02 00:40:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 659 transitions. [2018-12-02 00:40:16,451 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 659 transitions. Word has length 60 [2018-12-02 00:40:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:16,451 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 659 transitions. [2018-12-02 00:40:16,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 659 transitions. [2018-12-02 00:40:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 00:40:16,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:16,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:16,453 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:16,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 502127777, now seen corresponding path program 1 times [2018-12-02 00:40:16,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:16,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-12-02 00:40:16,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:16,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:16,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:16,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:16,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:16,485 INFO L87 Difference]: Start difference. First operand 529 states and 659 transitions. Second operand 5 states. [2018-12-02 00:40:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:16,697 INFO L93 Difference]: Finished difference Result 788 states and 988 transitions. [2018-12-02 00:40:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:16,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 00:40:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:16,700 INFO L225 Difference]: With dead ends: 788 [2018-12-02 00:40:16,700 INFO L226 Difference]: Without dead ends: 529 [2018-12-02 00:40:16,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-02 00:40:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-12-02 00:40:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-02 00:40:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 657 transitions. [2018-12-02 00:40:16,739 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 657 transitions. Word has length 68 [2018-12-02 00:40:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 657 transitions. [2018-12-02 00:40:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 657 transitions. [2018-12-02 00:40:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 00:40:16,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:16,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:16,741 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:16,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1762057128, now seen corresponding path program 1 times [2018-12-02 00:40:16,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:16,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:16,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:16,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:16,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:16,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:16,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:16,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:16,780 INFO L87 Difference]: Start difference. First operand 529 states and 657 transitions. Second operand 5 states. [2018-12-02 00:40:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:16,815 INFO L93 Difference]: Finished difference Result 648 states and 797 transitions. [2018-12-02 00:40:16,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:16,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-02 00:40:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:16,817 INFO L225 Difference]: With dead ends: 648 [2018-12-02 00:40:16,817 INFO L226 Difference]: Without dead ends: 535 [2018-12-02 00:40:16,817 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-12-02 00:40:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-02 00:40:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-12-02 00:40:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-02 00:40:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 661 transitions. [2018-12-02 00:40:16,840 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 661 transitions. Word has length 63 [2018-12-02 00:40:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:16,840 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 661 transitions. [2018-12-02 00:40:16,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 661 transitions. [2018-12-02 00:40:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 00:40:16,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:16,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:16,841 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:16,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash 517740439, now seen corresponding path program 1 times [2018-12-02 00:40:16,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:16,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:16,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:16,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:16,890 INFO L87 Difference]: Start difference. First operand 533 states and 661 transitions. Second operand 9 states. [2018-12-02 00:40:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:16,963 INFO L93 Difference]: Finished difference Result 666 states and 815 transitions. [2018-12-02 00:40:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:16,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-12-02 00:40:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:16,966 INFO L225 Difference]: With dead ends: 666 [2018-12-02 00:40:16,966 INFO L226 Difference]: Without dead ends: 535 [2018-12-02 00:40:16,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-02 00:40:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-12-02 00:40:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-02 00:40:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-12-02 00:40:17,004 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 63 [2018-12-02 00:40:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:17,005 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-12-02 00:40:17,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-12-02 00:40:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 00:40:17,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:17,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:17,006 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:17,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1193132232, now seen corresponding path program 1 times [2018-12-02 00:40:17,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:17,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:17,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:17,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:17,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:40:17,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:40:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:40:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:17,039 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 3 states. [2018-12-02 00:40:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:17,083 INFO L93 Difference]: Finished difference Result 808 states and 1014 transitions. [2018-12-02 00:40:17,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:40:17,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-02 00:40:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:17,086 INFO L225 Difference]: With dead ends: 808 [2018-12-02 00:40:17,086 INFO L226 Difference]: Without dead ends: 549 [2018-12-02 00:40:17,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:40:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-12-02 00:40:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2018-12-02 00:40:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-02 00:40:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-12-02 00:40:17,109 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 71 [2018-12-02 00:40:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:17,110 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-12-02 00:40:17,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:40:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-12-02 00:40:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 00:40:17,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:17,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:17,111 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:17,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1107799800, now seen corresponding path program 1 times [2018-12-02 00:40:17,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:17,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:17,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:17,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:17,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:17,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:17,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:17,149 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 6 states. [2018-12-02 00:40:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:17,193 INFO L93 Difference]: Finished difference Result 776 states and 968 transitions. [2018-12-02 00:40:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:17,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-02 00:40:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:17,195 INFO L225 Difference]: With dead ends: 776 [2018-12-02 00:40:17,196 INFO L226 Difference]: Without dead ends: 550 [2018-12-02 00:40:17,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-12-02 00:40:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2018-12-02 00:40:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-02 00:40:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 658 transitions. [2018-12-02 00:40:17,219 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 658 transitions. Word has length 71 [2018-12-02 00:40:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:17,219 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 658 transitions. [2018-12-02 00:40:17,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 658 transitions. [2018-12-02 00:40:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 00:40:17,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:17,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:17,220 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:17,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 848393777, now seen corresponding path program 1 times [2018-12-02 00:40:17,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:17,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:17,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:17,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:17,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:17,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:17,262 INFO L87 Difference]: Start difference. First operand 533 states and 658 transitions. Second operand 9 states. [2018-12-02 00:40:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:17,398 INFO L93 Difference]: Finished difference Result 550 states and 675 transitions. [2018-12-02 00:40:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:17,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-12-02 00:40:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:17,400 INFO L225 Difference]: With dead ends: 550 [2018-12-02 00:40:17,400 INFO L226 Difference]: Without dead ends: 529 [2018-12-02 00:40:17,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-02 00:40:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-12-02 00:40:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-02 00:40:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 652 transitions. [2018-12-02 00:40:17,437 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 652 transitions. Word has length 63 [2018-12-02 00:40:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:17,437 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 652 transitions. [2018-12-02 00:40:17,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 652 transitions. [2018-12-02 00:40:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 00:40:17,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:17,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:17,438 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:17,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1112788646, now seen corresponding path program 1 times [2018-12-02 00:40:17,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:17,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:17,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:17,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:17,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:17,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:40:17,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:40:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:40:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:40:17,475 INFO L87 Difference]: Start difference. First operand 529 states and 652 transitions. Second operand 8 states. [2018-12-02 00:40:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:17,576 INFO L93 Difference]: Finished difference Result 540 states and 662 transitions. [2018-12-02 00:40:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:40:17,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-12-02 00:40:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:17,578 INFO L225 Difference]: With dead ends: 540 [2018-12-02 00:40:17,578 INFO L226 Difference]: Without dead ends: 518 [2018-12-02 00:40:17,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-12-02 00:40:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-12-02 00:40:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-12-02 00:40:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 637 transitions. [2018-12-02 00:40:17,601 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 637 transitions. Word has length 64 [2018-12-02 00:40:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:17,601 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 637 transitions. [2018-12-02 00:40:17,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:40:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 637 transitions. [2018-12-02 00:40:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 00:40:17,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:17,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:17,602 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:17,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:17,603 INFO L82 PathProgramCache]: Analyzing trace with hash -757918773, now seen corresponding path program 1 times [2018-12-02 00:40:17,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:17,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:17,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:17,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:17,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:17,664 INFO L87 Difference]: Start difference. First operand 518 states and 637 transitions. Second operand 9 states. [2018-12-02 00:40:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:17,797 INFO L93 Difference]: Finished difference Result 535 states and 654 transitions. [2018-12-02 00:40:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:17,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-12-02 00:40:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:17,799 INFO L225 Difference]: With dead ends: 535 [2018-12-02 00:40:17,799 INFO L226 Difference]: Without dead ends: 513 [2018-12-02 00:40:17,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-02 00:40:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-12-02 00:40:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-12-02 00:40:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 630 transitions. [2018-12-02 00:40:17,822 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 630 transitions. Word has length 64 [2018-12-02 00:40:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:17,822 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 630 transitions. [2018-12-02 00:40:17,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 630 transitions. [2018-12-02 00:40:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 00:40:17,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:17,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:17,823 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:17,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1688030243, now seen corresponding path program 1 times [2018-12-02 00:40:17,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:17,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:17,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:17,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:17,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:17,860 INFO L87 Difference]: Start difference. First operand 513 states and 630 transitions. Second operand 9 states. [2018-12-02 00:40:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:17,991 INFO L93 Difference]: Finished difference Result 530 states and 647 transitions. [2018-12-02 00:40:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:17,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-12-02 00:40:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:17,993 INFO L225 Difference]: With dead ends: 530 [2018-12-02 00:40:17,993 INFO L226 Difference]: Without dead ends: 509 [2018-12-02 00:40:17,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-02 00:40:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-12-02 00:40:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-02 00:40:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 624 transitions. [2018-12-02 00:40:18,021 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 624 transitions. Word has length 64 [2018-12-02 00:40:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:18,021 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 624 transitions. [2018-12-02 00:40:18,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 624 transitions. [2018-12-02 00:40:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 00:40:18,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:18,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:18,022 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:18,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash 70476455, now seen corresponding path program 1 times [2018-12-02 00:40:18,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:18,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:18,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:18,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:18,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:18,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:18,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:18,107 INFO L87 Difference]: Start difference. First operand 509 states and 624 transitions. Second operand 5 states. [2018-12-02 00:40:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:18,397 INFO L93 Difference]: Finished difference Result 878 states and 1083 transitions. [2018-12-02 00:40:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:18,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 00:40:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:18,399 INFO L225 Difference]: With dead ends: 878 [2018-12-02 00:40:18,400 INFO L226 Difference]: Without dead ends: 625 [2018-12-02 00:40:18,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:40:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-12-02 00:40:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 583. [2018-12-02 00:40:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-12-02 00:40:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 718 transitions. [2018-12-02 00:40:18,436 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 718 transitions. Word has length 70 [2018-12-02 00:40:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:18,436 INFO L480 AbstractCegarLoop]: Abstraction has 583 states and 718 transitions. [2018-12-02 00:40:18,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2018-12-02 00:40:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 00:40:18,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:18,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:18,438 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:18,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1382250420, now seen corresponding path program 1 times [2018-12-02 00:40:18,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:18,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:18,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:18,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:18,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:18,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:18,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:18,481 INFO L87 Difference]: Start difference. First operand 583 states and 718 transitions. Second operand 9 states. [2018-12-02 00:40:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:18,612 INFO L93 Difference]: Finished difference Result 600 states and 735 transitions. [2018-12-02 00:40:18,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:18,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-02 00:40:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:18,614 INFO L225 Difference]: With dead ends: 600 [2018-12-02 00:40:18,614 INFO L226 Difference]: Without dead ends: 557 [2018-12-02 00:40:18,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-12-02 00:40:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-12-02 00:40:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-12-02 00:40:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 686 transitions. [2018-12-02 00:40:18,641 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 686 transitions. Word has length 68 [2018-12-02 00:40:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:18,641 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 686 transitions. [2018-12-02 00:40:18,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 686 transitions. [2018-12-02 00:40:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 00:40:18,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:18,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:18,642 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:18,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1735546476, now seen corresponding path program 1 times [2018-12-02 00:40:18,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:18,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:18,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:18,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:18,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:18,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:18,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:18,685 INFO L87 Difference]: Start difference. First operand 557 states and 686 transitions. Second operand 9 states. [2018-12-02 00:40:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:18,740 INFO L93 Difference]: Finished difference Result 592 states and 726 transitions. [2018-12-02 00:40:18,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:18,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-12-02 00:40:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:18,741 INFO L225 Difference]: With dead ends: 592 [2018-12-02 00:40:18,741 INFO L226 Difference]: Without dead ends: 565 [2018-12-02 00:40:18,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-12-02 00:40:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2018-12-02 00:40:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-12-02 00:40:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 693 transitions. [2018-12-02 00:40:18,771 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 693 transitions. Word has length 76 [2018-12-02 00:40:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:18,771 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 693 transitions. [2018-12-02 00:40:18,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 693 transitions. [2018-12-02 00:40:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 00:40:18,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:18,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:18,772 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:18,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1846504819, now seen corresponding path program 1 times [2018-12-02 00:40:18,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:18,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:18,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:18,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:18,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:18,805 INFO L87 Difference]: Start difference. First operand 563 states and 693 transitions. Second operand 5 states. [2018-12-02 00:40:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:18,853 INFO L93 Difference]: Finished difference Result 657 states and 801 transitions. [2018-12-02 00:40:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:18,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-02 00:40:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:18,855 INFO L225 Difference]: With dead ends: 657 [2018-12-02 00:40:18,855 INFO L226 Difference]: Without dead ends: 510 [2018-12-02 00:40:18,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-12-02 00:40:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-12-02 00:40:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-12-02 00:40:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 624 transitions. [2018-12-02 00:40:18,887 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 624 transitions. Word has length 76 [2018-12-02 00:40:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:18,887 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 624 transitions. [2018-12-02 00:40:18,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 624 transitions. [2018-12-02 00:40:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 00:40:18,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:18,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:18,888 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:18,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1102145568, now seen corresponding path program 1 times [2018-12-02 00:40:18,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:18,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:18,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:40:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:40:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:40:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:18,968 INFO L87 Difference]: Start difference. First operand 510 states and 624 transitions. Second operand 7 states. [2018-12-02 00:40:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:19,355 INFO L93 Difference]: Finished difference Result 814 states and 1002 transitions. [2018-12-02 00:40:19,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:40:19,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 00:40:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:19,356 INFO L225 Difference]: With dead ends: 814 [2018-12-02 00:40:19,356 INFO L226 Difference]: Without dead ends: 505 [2018-12-02 00:40:19,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-02 00:40:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-02 00:40:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2018-12-02 00:40:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-02 00:40:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 599 transitions. [2018-12-02 00:40:19,381 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 599 transitions. Word has length 82 [2018-12-02 00:40:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:19,381 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 599 transitions. [2018-12-02 00:40:19,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:40:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 599 transitions. [2018-12-02 00:40:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 00:40:19,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:19,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:19,382 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:19,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1177659047, now seen corresponding path program 1 times [2018-12-02 00:40:19,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:19,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:19,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:19,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:19,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:19,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:19,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:19,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:19,439 INFO L87 Difference]: Start difference. First operand 494 states and 599 transitions. Second operand 6 states. [2018-12-02 00:40:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:19,491 INFO L93 Difference]: Finished difference Result 801 states and 999 transitions. [2018-12-02 00:40:19,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:19,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-02 00:40:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:19,493 INFO L225 Difference]: With dead ends: 801 [2018-12-02 00:40:19,493 INFO L226 Difference]: Without dead ends: 547 [2018-12-02 00:40:19,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-02 00:40:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 460. [2018-12-02 00:40:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-02 00:40:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 555 transitions. [2018-12-02 00:40:19,517 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 555 transitions. Word has length 83 [2018-12-02 00:40:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:19,517 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 555 transitions. [2018-12-02 00:40:19,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 555 transitions. [2018-12-02 00:40:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 00:40:19,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:19,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:19,518 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:19,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash 583311642, now seen corresponding path program 1 times [2018-12-02 00:40:19,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:19,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:19,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:19,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:19,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:19,549 INFO L87 Difference]: Start difference. First operand 460 states and 555 transitions. Second operand 5 states. [2018-12-02 00:40:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:19,830 INFO L93 Difference]: Finished difference Result 880 states and 1043 transitions. [2018-12-02 00:40:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:19,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 00:40:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:19,831 INFO L225 Difference]: With dead ends: 880 [2018-12-02 00:40:19,831 INFO L226 Difference]: Without dead ends: 561 [2018-12-02 00:40:19,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-02 00:40:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 538. [2018-12-02 00:40:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-02 00:40:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 637 transitions. [2018-12-02 00:40:19,859 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 637 transitions. Word has length 78 [2018-12-02 00:40:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:19,859 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 637 transitions. [2018-12-02 00:40:19,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 637 transitions. [2018-12-02 00:40:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 00:40:19,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:19,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:19,860 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:19,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:19,860 INFO L82 PathProgramCache]: Analyzing trace with hash -561171894, now seen corresponding path program 1 times [2018-12-02 00:40:19,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:19,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:19,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:19,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:19,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:19,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:19,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:19,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:19,910 INFO L87 Difference]: Start difference. First operand 538 states and 637 transitions. Second operand 9 states. [2018-12-02 00:40:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:19,994 INFO L93 Difference]: Finished difference Result 540 states and 638 transitions. [2018-12-02 00:40:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:19,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-12-02 00:40:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:19,996 INFO L225 Difference]: With dead ends: 540 [2018-12-02 00:40:19,996 INFO L226 Difference]: Without dead ends: 449 [2018-12-02 00:40:19,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-02 00:40:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-12-02 00:40:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-02 00:40:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 535 transitions. [2018-12-02 00:40:20,020 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 535 transitions. Word has length 81 [2018-12-02 00:40:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:20,020 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 535 transitions. [2018-12-02 00:40:20,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 535 transitions. [2018-12-02 00:40:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 00:40:20,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:20,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:20,020 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:20,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1831635273, now seen corresponding path program 1 times [2018-12-02 00:40:20,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:20,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:20,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:20,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:20,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:20,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:20,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:20,069 INFO L87 Difference]: Start difference. First operand 449 states and 535 transitions. Second operand 9 states. [2018-12-02 00:40:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:20,173 INFO L93 Difference]: Finished difference Result 470 states and 557 transitions. [2018-12-02 00:40:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:20,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-12-02 00:40:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:20,174 INFO L225 Difference]: With dead ends: 470 [2018-12-02 00:40:20,174 INFO L226 Difference]: Without dead ends: 449 [2018-12-02 00:40:20,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-02 00:40:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-02 00:40:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-12-02 00:40:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-02 00:40:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 534 transitions. [2018-12-02 00:40:20,198 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 534 transitions. Word has length 88 [2018-12-02 00:40:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:20,198 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 534 transitions. [2018-12-02 00:40:20,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 534 transitions. [2018-12-02 00:40:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 00:40:20,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:20,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:20,199 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:20,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1636495317, now seen corresponding path program 1 times [2018-12-02 00:40:20,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:20,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:20,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:20,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:20,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:20,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:20,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:20,233 INFO L87 Difference]: Start difference. First operand 449 states and 534 transitions. Second operand 6 states. [2018-12-02 00:40:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:20,269 INFO L93 Difference]: Finished difference Result 482 states and 566 transitions. [2018-12-02 00:40:20,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:20,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 00:40:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:20,270 INFO L225 Difference]: With dead ends: 482 [2018-12-02 00:40:20,271 INFO L226 Difference]: Without dead ends: 443 [2018-12-02 00:40:20,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-02 00:40:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 390. [2018-12-02 00:40:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-12-02 00:40:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 458 transitions. [2018-12-02 00:40:20,308 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 458 transitions. Word has length 99 [2018-12-02 00:40:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:20,309 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 458 transitions. [2018-12-02 00:40:20,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 458 transitions. [2018-12-02 00:40:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 00:40:20,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:20,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:20,310 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:20,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash -363913567, now seen corresponding path program 1 times [2018-12-02 00:40:20,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:20,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:20,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:20,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:20,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:20,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:40:20,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:40:20,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:40:20,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:20,367 INFO L87 Difference]: Start difference. First operand 390 states and 458 transitions. Second operand 7 states. [2018-12-02 00:40:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:20,503 INFO L93 Difference]: Finished difference Result 736 states and 870 transitions. [2018-12-02 00:40:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:20,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 00:40:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:20,505 INFO L225 Difference]: With dead ends: 736 [2018-12-02 00:40:20,505 INFO L226 Difference]: Without dead ends: 691 [2018-12-02 00:40:20,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-12-02 00:40:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 370. [2018-12-02 00:40:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-12-02 00:40:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 433 transitions. [2018-12-02 00:40:20,533 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 433 transitions. Word has length 99 [2018-12-02 00:40:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:20,534 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 433 transitions. [2018-12-02 00:40:20,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:40:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 433 transitions. [2018-12-02 00:40:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 00:40:20,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:20,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:20,542 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:20,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1119440733, now seen corresponding path program 1 times [2018-12-02 00:40:20,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:40:20,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 00:40:20,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 00:40:20,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 00:40:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:20,617 INFO L87 Difference]: Start difference. First operand 370 states and 433 transitions. Second operand 11 states. [2018-12-02 00:40:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:20,685 INFO L93 Difference]: Finished difference Result 515 states and 607 transitions. [2018-12-02 00:40:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:40:20,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2018-12-02 00:40:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:20,686 INFO L225 Difference]: With dead ends: 515 [2018-12-02 00:40:20,686 INFO L226 Difference]: Without dead ends: 366 [2018-12-02 00:40:20,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 00:40:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-02 00:40:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2018-12-02 00:40:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-02 00:40:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 410 transitions. [2018-12-02 00:40:20,708 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 410 transitions. Word has length 104 [2018-12-02 00:40:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:20,708 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 410 transitions. [2018-12-02 00:40:20,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 00:40:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 410 transitions. [2018-12-02 00:40:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 00:40:20,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:20,708 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-12-02 00:40:20,708 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:20,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1545373669, now seen corresponding path program 1 times [2018-12-02 00:40:20,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:20,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 00:40:20,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:20,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:20,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:20,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:20,753 INFO L87 Difference]: Start difference. First operand 353 states and 410 transitions. Second operand 6 states. [2018-12-02 00:40:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:20,801 INFO L93 Difference]: Finished difference Result 381 states and 437 transitions. [2018-12-02 00:40:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:20,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-02 00:40:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:20,802 INFO L225 Difference]: With dead ends: 381 [2018-12-02 00:40:20,802 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 00:40:20,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 00:40:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2018-12-02 00:40:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-02 00:40:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2018-12-02 00:40:20,817 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 113 [2018-12-02 00:40:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:20,818 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2018-12-02 00:40:20,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2018-12-02 00:40:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-02 00:40:20,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:20,818 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-12-02 00:40:20,818 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:20,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 268673567, now seen corresponding path program 1 times [2018-12-02 00:40:20,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:20,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:20,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:20,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 00:40:20,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:20,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:20,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:20,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:20,885 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand 9 states. [2018-12-02 00:40:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:20,945 INFO L93 Difference]: Finished difference Result 316 states and 358 transitions. [2018-12-02 00:40:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:20,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-12-02 00:40:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:20,946 INFO L225 Difference]: With dead ends: 316 [2018-12-02 00:40:20,946 INFO L226 Difference]: Without dead ends: 287 [2018-12-02 00:40:20,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-02 00:40:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2018-12-02 00:40:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 00:40:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2018-12-02 00:40:20,962 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 134 [2018-12-02 00:40:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:20,962 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2018-12-02 00:40:20,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2018-12-02 00:40:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-02 00:40:20,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:20,963 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-12-02 00:40:20,963 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:20,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 13585617, now seen corresponding path program 1 times [2018-12-02 00:40:20,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:20,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 00:40:21,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:21,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:21,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:21,010 INFO L87 Difference]: Start difference. First operand 263 states and 295 transitions. Second operand 9 states. [2018-12-02 00:40:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:21,069 INFO L93 Difference]: Finished difference Result 338 states and 379 transitions. [2018-12-02 00:40:21,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:21,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-12-02 00:40:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:21,070 INFO L225 Difference]: With dead ends: 338 [2018-12-02 00:40:21,070 INFO L226 Difference]: Without dead ends: 267 [2018-12-02 00:40:21,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-02 00:40:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2018-12-02 00:40:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-02 00:40:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2018-12-02 00:40:21,086 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 135 [2018-12-02 00:40:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:21,086 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2018-12-02 00:40:21,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2018-12-02 00:40:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-02 00:40:21,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:21,086 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:21,086 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:21,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash -834804230, now seen corresponding path program 1 times [2018-12-02 00:40:21,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:21,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:21,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 00:40:21,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:21,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:40:21,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:40:21,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:40:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:21,115 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand 5 states. [2018-12-02 00:40:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:21,135 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2018-12-02 00:40:21,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:40:21,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-12-02 00:40:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:21,136 INFO L225 Difference]: With dead ends: 281 [2018-12-02 00:40:21,136 INFO L226 Difference]: Without dead ends: 251 [2018-12-02 00:40:21,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:40:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-02 00:40:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-12-02 00:40:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 00:40:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2018-12-02 00:40:21,152 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 150 [2018-12-02 00:40:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:21,152 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2018-12-02 00:40:21,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:40:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2018-12-02 00:40:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-02 00:40:21,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:21,152 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:40:21,152 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:21,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash -653317733, now seen corresponding path program 1 times [2018-12-02 00:40:21,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:21,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 00:40:21,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:21,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-02 00:40:21,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 00:40:21,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 00:40:21,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-02 00:40:21,235 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand 15 states. [2018-12-02 00:40:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:21,356 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-12-02 00:40:21,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 00:40:21,356 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2018-12-02 00:40:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:21,357 INFO L225 Difference]: With dead ends: 315 [2018-12-02 00:40:21,357 INFO L226 Difference]: Without dead ends: 280 [2018-12-02 00:40:21,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-02 00:40:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-02 00:40:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 266. [2018-12-02 00:40:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-02 00:40:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 295 transitions. [2018-12-02 00:40:21,373 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 295 transitions. Word has length 150 [2018-12-02 00:40:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:21,373 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 295 transitions. [2018-12-02 00:40:21,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 00:40:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 295 transitions. [2018-12-02 00:40:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 00:40:21,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:21,374 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-12-02 00:40:21,374 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:21,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1218236339, now seen corresponding path program 1 times [2018-12-02 00:40:21,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:21,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 00:40:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:21,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:40:21,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:40:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:40:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:40:21,426 INFO L87 Difference]: Start difference. First operand 266 states and 295 transitions. Second operand 9 states. [2018-12-02 00:40:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:21,477 INFO L93 Difference]: Finished difference Result 355 states and 396 transitions. [2018-12-02 00:40:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:40:21,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2018-12-02 00:40:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:21,477 INFO L225 Difference]: With dead ends: 355 [2018-12-02 00:40:21,478 INFO L226 Difference]: Without dead ends: 274 [2018-12-02 00:40:21,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:40:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-02 00:40:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-12-02 00:40:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-02 00:40:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 294 transitions. [2018-12-02 00:40:21,494 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 294 transitions. Word has length 151 [2018-12-02 00:40:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:21,494 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 294 transitions. [2018-12-02 00:40:21,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:40:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 294 transitions. [2018-12-02 00:40:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 00:40:21,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:21,494 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-12-02 00:40:21,495 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:21,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1765810406, now seen corresponding path program 1 times [2018-12-02 00:40:21,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:21,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:21,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 00:40:21,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:40:21,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:40:21,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:21,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:40:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 00:40:21,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:40:21,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-12-02 00:40:21,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 00:40:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 00:40:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-02 00:40:21,841 INFO L87 Difference]: Start difference. First operand 266 states and 294 transitions. Second operand 21 states. [2018-12-02 00:40:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:21,999 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-12-02 00:40:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 00:40:22,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2018-12-02 00:40:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:22,001 INFO L225 Difference]: With dead ends: 311 [2018-12-02 00:40:22,001 INFO L226 Difference]: Without dead ends: 270 [2018-12-02 00:40:22,002 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-12-02 00:40:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-02 00:40:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-12-02 00:40:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 00:40:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2018-12-02 00:40:22,022 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 153 [2018-12-02 00:40:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:22,023 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2018-12-02 00:40:22,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 00:40:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2018-12-02 00:40:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 00:40:22,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:22,024 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-12-02 00:40:22,024 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:22,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash 244162299, now seen corresponding path program 1 times [2018-12-02 00:40:22,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:22,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 00:40:22,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:40:22,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:40:22,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:22,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:40:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 00:40:22,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:40:22,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-12-02 00:40:22,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 00:40:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 00:40:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-02 00:40:22,288 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 14 states. [2018-12-02 00:40:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:22,431 INFO L93 Difference]: Finished difference Result 321 states and 350 transitions. [2018-12-02 00:40:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:40:22,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2018-12-02 00:40:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:22,432 INFO L225 Difference]: With dead ends: 321 [2018-12-02 00:40:22,432 INFO L226 Difference]: Without dead ends: 246 [2018-12-02 00:40:22,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-02 00:40:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-02 00:40:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2018-12-02 00:40:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 00:40:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-12-02 00:40:22,452 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 158 [2018-12-02 00:40:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:22,452 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-12-02 00:40:22,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 00:40:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-12-02 00:40:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 00:40:22,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:22,453 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-12-02 00:40:22,453 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:22,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1521484890, now seen corresponding path program 1 times [2018-12-02 00:40:22,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:22,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:22,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:22,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 00:40:22,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:22,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:40:22,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:40:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:40:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:40:22,497 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 6 states. [2018-12-02 00:40:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:22,533 INFO L93 Difference]: Finished difference Result 322 states and 349 transitions. [2018-12-02 00:40:22,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:40:22,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-12-02 00:40:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:22,534 INFO L225 Difference]: With dead ends: 322 [2018-12-02 00:40:22,534 INFO L226 Difference]: Without dead ends: 237 [2018-12-02 00:40:22,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:40:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-02 00:40:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2018-12-02 00:40:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-02 00:40:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2018-12-02 00:40:22,552 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 160 [2018-12-02 00:40:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:22,552 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2018-12-02 00:40:22,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:40:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2018-12-02 00:40:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 00:40:22,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:22,553 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-12-02 00:40:22,554 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:22,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1127797900, now seen corresponding path program 1 times [2018-12-02 00:40:22,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:22,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:22,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 00:40:22,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:40:22,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 00:40:22,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 00:40:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 00:40:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:40:22,628 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 10 states. [2018-12-02 00:40:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:23,059 INFO L93 Difference]: Finished difference Result 456 states and 493 transitions. [2018-12-02 00:40:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 00:40:23,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-12-02 00:40:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:23,061 INFO L225 Difference]: With dead ends: 456 [2018-12-02 00:40:23,061 INFO L226 Difference]: Without dead ends: 234 [2018-12-02 00:40:23,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-12-02 00:40:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-02 00:40:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-12-02 00:40:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-02 00:40:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 248 transitions. [2018-12-02 00:40:23,089 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 248 transitions. Word has length 161 [2018-12-02 00:40:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:23,089 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 248 transitions. [2018-12-02 00:40:23,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 00:40:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 248 transitions. [2018-12-02 00:40:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 00:40:23,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:40:23,090 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-12-02 00:40:23,091 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:40:23,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:40:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash 204630474, now seen corresponding path program 1 times [2018-12-02 00:40:23,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:40:23,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:40:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:23,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:40:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 00:40:23,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:40:23,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:40:23,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:40:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:40:23,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:40:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 00:40:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:40:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-12-02 00:40:23,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 00:40:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 00:40:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-02 00:40:23,373 INFO L87 Difference]: Start difference. First operand 231 states and 248 transitions. Second operand 19 states. [2018-12-02 00:40:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:40:24,005 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2018-12-02 00:40:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 00:40:24,005 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 161 [2018-12-02 00:40:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:40:24,005 INFO L225 Difference]: With dead ends: 302 [2018-12-02 00:40:24,005 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 00:40:24,006 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-12-02 00:40:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 00:40:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 00:40:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 00:40:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 00:40:24,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-12-02 00:40:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:40:24,007 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:40:24,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 00:40:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 00:40:24,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 00:40:24,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 00:40:24,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:24,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:25,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:25,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:25,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:25,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:25,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:25,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:40:25,223 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-02 00:40:25,420 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 68 [2018-12-02 00:40:25,551 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2018-12-02 00:40:25,903 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-12-02 00:40:26,057 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 68 [2018-12-02 00:40:26,284 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 71 [2018-12-02 00:40:26,566 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 61 [2018-12-02 00:40:26,991 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 96 [2018-12-02 00:40:27,741 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 104 [2018-12-02 00:40:28,287 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-12-02 00:40:28,652 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 95 [2018-12-02 00:40:28,860 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2018-12-02 00:40:28,985 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-12-02 00:40:29,177 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-12-02 00:40:29,446 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-12-02 00:40:30,653 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2018-12-02 00:40:31,169 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 100 [2018-12-02 00:40:31,317 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2018-12-02 00:40:32,257 WARN L180 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 84 [2018-12-02 00:40:33,170 WARN L180 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 117 [2018-12-02 00:40:33,466 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2018-12-02 00:40:33,949 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 87 [2018-12-02 00:40:34,182 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2018-12-02 00:40:34,767 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2018-12-02 00:40:34,997 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2018-12-02 00:40:35,456 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2018-12-02 00:40:35,777 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-12-02 00:40:35,931 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-12-02 00:40:36,061 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-02 00:40:36,467 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 87 [2018-12-02 00:40:37,588 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-12-02 00:40:38,181 WARN L180 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-12-02 00:40:38,307 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-12-02 00:40:38,483 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2018-12-02 00:40:38,768 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-12-02 00:40:39,089 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 82 [2018-12-02 00:40:39,346 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 68 [2018-12-02 00:40:39,533 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2018-12-02 00:40:39,679 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-12-02 00:40:40,062 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2018-12-02 00:40:40,896 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-12-02 00:40:42,018 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-12-02 00:40:42,817 WARN L180 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-12-02 00:40:43,015 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-02 00:40:43,477 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2018-12-02 00:40:43,679 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-12-02 00:40:43,931 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2018-12-02 00:40:44,481 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-02 00:40:44,767 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2018-12-02 00:40:45,367 WARN L180 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-12-02 00:40:45,821 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2018-12-02 00:40:46,092 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2018-12-02 00:40:46,562 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 89 [2018-12-02 00:40:47,423 WARN L180 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 63 [2018-12-02 00:40:47,597 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 1 [2018-12-02 00:40:47,953 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2018-12-02 00:40:48,388 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2018-12-02 00:40:48,635 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-02 00:40:48,791 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2018-12-02 00:40:49,038 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2018-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2018-12-02 00:40:49,075 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2018-12-02 00:40:49,075 INFO L451 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2018-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 919 926) no Hoare annotation was computed. [2018-12-02 00:40:49,075 INFO L451 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2018-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2018-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 919 926) no Hoare annotation was computed. [2018-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2018-12-02 00:40:49,075 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-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2018-12-02 00:40:49,075 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L451 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2018-12-02 00:40:49,076 INFO L451 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 940 947) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 940 947) no Hoare annotation was computed. [2018-12-02 00:40:49,076 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-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2018-12-02 00:40:49,076 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-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2018-12-02 00:40:49,076 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-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2018-12-02 00:40:49,076 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2018-12-02 00:40:49,077 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-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2018-12-02 00:40:49,077 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-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2018-12-02 00:40:49,077 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-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2018-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2018-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 228 418) no Hoare annotation was computed. [2018-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 228 418) no Hoare annotation was computed. [2018-12-02 00:40:49,077 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-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-12-02 00:40:49,077 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2018-12-02 00:40:49,077 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-12-02 00:40:49,077 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-12-02 00:40:49,077 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-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2018-12-02 00:40:49,078 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-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-12-02 00:40:49,078 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-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2018-12-02 00:40:49,078 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-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2018-12-02 00:40:49,078 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-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2018-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2018-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2018-12-02 00:40:49,078 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-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2018-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2018-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2018-12-02 00:40:49,078 INFO L448 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2018-12-02 00:40:49,079 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-12-02 00:40:49,079 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2018-12-02 00:40:49,079 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-12-02 00:40:49,079 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-12-02 00:40:49,079 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2018-12-02 00:40:49,079 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2018-12-02 00:40:49,079 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-12-02 00:40:49,079 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-12-02 00:40:49,079 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-12-02 00:40:49,079 INFO L448 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2018-12-02 00:40:49,079 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-12-02 00:40:49,079 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-12-02 00:40:49,079 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2018-12-02 00:40:49,079 INFO L448 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2018-12-02 00:40:49,080 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-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2018-12-02 00:40:49,080 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-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2018-12-02 00:40:49,080 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-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2018-12-02 00:40:49,080 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-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2018-12-02 00:40:49,080 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2018-12-02 00:40:49,081 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-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2018-12-02 00:40:49,081 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-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2018-12-02 00:40:49,081 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-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2018-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2018-12-02 00:40:49,081 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-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2018-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2018-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2018-12-02 00:40:49,081 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-12-02 00:40:49,081 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-12-02 00:40:49,081 INFO L448 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2018-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2018-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2018-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2018-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2018-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2018-12-02 00:40:49,082 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-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2018-12-02 00:40:49,082 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-12-02 00:40:49,082 INFO L448 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2018-12-02 00:40:49,083 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-12-02 00:40:49,083 INFO L448 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2018-12-02 00:40:49,083 INFO L448 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2018-12-02 00:40:49,083 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 748 773) no Hoare annotation was computed. [2018-12-02 00:40:49,083 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 748 773) no Hoare annotation was computed. [2018-12-02 00:40:49,083 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2018-12-02 00:40:49,083 INFO L448 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2018-12-02 00:40:49,083 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-12-02 00:40:49,084 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-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2018-12-02 00:40:49,084 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-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2018-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2018-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2018-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2018-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2018-12-02 00:40:49,084 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-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2018-12-02 00:40:49,084 INFO L448 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2018-12-02 00:40:49,085 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-12-02 00:40:49,085 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-12-02 00:40:49,085 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-12-02 00:40:49,085 INFO L448 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2018-12-02 00:40:49,085 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-12-02 00:40:49,085 INFO L448 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2018-12-02 00:40:49,086 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-12-02 00:40:49,086 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-12-02 00:40:49,086 INFO L448 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2018-12-02 00:40:49,086 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-12-02 00:40:49,086 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-12-02 00:40:49,086 INFO L448 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2018-12-02 00:40:49,086 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2018-12-02 00:40:49,086 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-12-02 00:40:49,087 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2018-12-02 00:40:49,087 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-12-02 00:40:49,087 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-12-02 00:40:49,087 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-12-02 00:40:49,087 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2018-12-02 00:40:49,087 INFO L451 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2018-12-02 00:40:49,087 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-12-02 00:40:49,087 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2018-12-02 00:40:49,087 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2018-12-02 00:40:49,087 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2018-12-02 00:40:49,088 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-12-02 00:40:49,088 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2018-12-02 00:40:49,088 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-12-02 00:40:49,088 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2018-12-02 00:40:49,088 INFO L448 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2018-12-02 00:40:49,088 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1091 1098) no Hoare annotation was computed. [2018-12-02 00:40:49,088 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1091 1098) no Hoare annotation was computed. [2018-12-02 00:40:49,089 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2018-12-02 00:40:49,089 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2018-12-02 00:40:49,089 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2018-12-02 00:40:49,089 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-12-02 00:40:49,089 INFO L448 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2018-12-02 00:40:49,089 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-12-02 00:40:49,090 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-12-02 00:40:49,092 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-12-02 00:40:49,092 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-12-02 00:40:49,092 INFO L448 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2018-12-02 00:40:49,092 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2018-12-02 00:40:49,092 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2018-12-02 00:40:49,092 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2018-12-02 00:40:49,092 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2018-12-02 00:40:49,097 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-12-02 00:40:49,097 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-12-02 00:40:49,097 INFO L448 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2018-12-02 00:40:49,097 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-12-02 00:40:49,098 INFO L448 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2018-12-02 00:40:49,098 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-12-02 00:40:49,098 INFO L448 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2018-12-02 00:40:49,098 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-12-02 00:40:49,098 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-12-02 00:40:49,102 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-12-02 00:40:49,102 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-12-02 00:40:49,102 INFO L448 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2018-12-02 00:40:49,102 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2018-12-02 00:40:49,102 INFO L448 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2018-12-02 00:40:49,102 INFO L448 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2018-12-02 00:40:49,103 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-12-02 00:40:49,103 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2018-12-02 00:40:49,103 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2018-12-02 00:40:49,103 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2018-12-02 00:40:49,103 INFO L448 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2018-12-02 00:40:49,103 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2018-12-02 00:40:49,107 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-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2018-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2018-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2018-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2018-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2018-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2018-12-02 00:40:49,108 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-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2018-12-02 00:40:49,108 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2018-12-02 00:40:49,108 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-12-02 00:40:49,108 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-12-02 00:40:49,111 INFO L448 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2018-12-02 00:40:49,112 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-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L451 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L451 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1135 1142) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1135 1142) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L451 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2018-12-02 00:40:49,112 INFO L451 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1113 1120) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1113 1120) no Hoare annotation was computed. [2018-12-02 00:40:49,112 INFO L448 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2018-12-02 00:40:49,118 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 853 860) no Hoare annotation was computed. [2018-12-02 00:40:49,119 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-12-02 00:40:49,119 INFO L451 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2018-12-02 00:40:49,119 INFO L451 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 853 860) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2018-12-02 00:40:49,119 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-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2018-12-02 00:40:49,119 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2018-12-02 00:40:49,120 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-12-02 00:40:49,124 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-12-02 00:40:49,124 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2018-12-02 00:40:49,124 INFO L448 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2018-12-02 00:40:49,124 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-12-02 00:40:49,130 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-12-02 00:40:49,130 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2018-12-02 00:40:49,130 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2018-12-02 00:40:49,130 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2018-12-02 00:40:49,130 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2018-12-02 00:40:49,130 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-12-02 00:40:49,136 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-12-02 00:40:49,136 INFO L448 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2018-12-02 00:40:49,136 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-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 997 1009) no Hoare annotation was computed. [2018-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 997 1009) no Hoare annotation was computed. [2018-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2018-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2018-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2018-12-02 00:40:49,140 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-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2018-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2018-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-12-02 00:40:49,140 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-12-02 00:40:49,140 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2018-12-02 00:40:49,141 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2018-12-02 00:40:49,141 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-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2018-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2018-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2018-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2018-12-02 00:40:49,144 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-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2018-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2018-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2018-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2018-12-02 00:40:49,144 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-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-12-02 00:40:49,144 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-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2018-12-02 00:40:49,144 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-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2018-12-02 00:40:49,144 INFO L448 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2018-12-02 00:40:49,145 INFO L448 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2018-12-02 00:40:49,145 INFO L448 ceAbstractionStarter]: For program point $Ultimate##38(lines 1400 1526) no Hoare annotation was computed. [2018-12-02 00:40:49,145 INFO L448 ceAbstractionStarter]: For program point $Ultimate##37(lines 1400 1526) no Hoare annotation was computed. [2018-12-02 00:40:49,147 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-12-02 00:40:49,147 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2018-12-02 00:40:49,147 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2018-12-02 00:40:49,147 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-12-02 00:40:49,147 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-12-02 00:40:49,147 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2018-12-02 00:40:49,147 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-12-02 00:40:49,147 INFO L448 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2018-12-02 00:40:49,147 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-12-02 00:40:49,147 INFO L448 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2018-12-02 00:40:49,147 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-12-02 00:40:49,147 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2018-12-02 00:40:49,148 INFO L448 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2018-12-02 00:40:49,148 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-12-02 00:40:49,148 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-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2018-12-02 00:40:49,154 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-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2018-12-02 00:40:49,154 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-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2018-12-02 00:40:49,154 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-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2018-12-02 00:40:49,154 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2018-12-02 00:40:49,155 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2018-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2018-12-02 00:40:49,156 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-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2018-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2018-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2018-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2018-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2018-12-02 00:40:49,156 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-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2018-12-02 00:40:49,156 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2018-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2018-12-02 00:40:49,157 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-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2018-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2018-12-02 00:40:49,157 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-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2018-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2018-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2018-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2018-12-02 00:40:49,157 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2018-12-02 00:40:49,160 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2018-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2018-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2018-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 00:40:49,160 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:40:49,160 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-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2018-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2018-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2018-12-02 00:40:49,160 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-12-02 00:40:49,160 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2018-12-02 00:40:49,161 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2018-12-02 00:40:49,161 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2018-12-02 00:40:49,161 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-12-02 00:40:49,161 INFO L448 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2018-12-02 00:40:49,161 INFO L448 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2018-12-02 00:40:49,161 INFO L448 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2018-12-02 00:40:49,161 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2018-12-02 00:40:49,161 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-12-02 00:40:49,162 INFO L448 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-12-02 00:40:49,162 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2018-12-02 00:40:49,162 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-12-02 00:40:49,162 INFO L448 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2018-12-02 00:40:49,163 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-12-02 00:40:49,163 INFO L448 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2018-12-02 00:40:49,163 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2018-12-02 00:40:49,163 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2018-12-02 00:40:49,163 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-12-02 00:40:49,166 INFO L448 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2018-12-02 00:40:49,166 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2018-12-02 00:40:49,166 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2018-12-02 00:40:49,166 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2018-12-02 00:40:49,166 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2018-12-02 00:40:49,166 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:40:49,166 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (<= ~MaximumInterfaceType~0 0)) [2018-12-02 00:40:49,167 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 00:40:49,167 INFO L451 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2018-12-02 00:40:49,167 INFO L451 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 897 904) no Hoare annotation was computed. [2018-12-02 00:40:49,167 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 897 904) no Hoare annotation was computed. [2018-12-02 00:40:49,167 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2018-12-02 00:40:49,167 INFO L451 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2018-12-02 00:40:49,167 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L451 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 874 881) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 874 881) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L451 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1156 1163) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L451 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2018-12-02 00:40:49,171 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1156 1163) no Hoare annotation was computed. [2018-12-02 00:40:49,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:40:49 BoogieIcfgContainer [2018-12-02 00:40:49,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 00:40:49,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:40:49,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:40:49,220 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:40:49,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:09" (3/4) ... [2018-12-02 00:40:49,224 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 00:40:49,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-12-02 00:40:49,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-02 00:40:49,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-12-02 00:40:49,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-12-02 00:40:49,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 00:40:49,231 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-12-02 00:40:49,232 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-12-02 00:40:49,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 00:40:49,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-12-02 00:40:49,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-12-02 00:40:49,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-12-02 00:40:49,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-12-02 00:40:49,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-12-02 00:40:49,233 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-02 00:40:49,248 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2018-12-02 00:40:49,249 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2018-12-02 00:40:49,250 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 00:40:49,251 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 00:40:49,278 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-12-02 00:40:49,278 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-12-02 00:40:49,279 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-12-02 00:40:49,279 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-12-02 00:40:49,280 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-12-02 00:40:49,280 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-12-02 00:40:49,281 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-12-02 00:40:49,281 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-12-02 00:40:49,281 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-12-02 00:40:49,281 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-12-02 00:40:49,281 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-12-02 00:40:49,282 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-12-02 00:40:49,282 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-12-02 00:40:49,282 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-12-02 00:40:49,282 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-12-02 00:40:49,283 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-12-02 00:40:49,283 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-12-02 00:40:49,283 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-12-02 00:40:49,283 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-12-02 00:40:49,283 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-02 00:40:49,284 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-12-02 00:40:49,285 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-12-02 00:40:49,285 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-12-02 00:40:49,285 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-12-02 00:40:49,285 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-12-02 00:40:49,285 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-12-02 00:40:49,285 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-12-02 00:40:49,287 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-12-02 00:40:49,287 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-12-02 00:40:49,287 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-12-02 00:40:49,287 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-12-02 00:40:49,287 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-12-02 00:40:49,292 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-12-02 00:40:49,400 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d701f30d-dedc-4f49-8f61-f05fee757cbb/bin-2019/uautomizer/witness.graphml [2018-12-02 00:40:49,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:40:49,401 INFO L168 Benchmark]: Toolchain (without parser) took 41108.48 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 871.4 MB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -412.9 MB). Peak memory consumption was 458.5 MB. Max. memory is 11.5 GB. [2018-12-02 00:40:49,401 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:40:49,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -111.3 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-02 00:40:49,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:40:49,402 INFO L168 Benchmark]: Boogie Preprocessor took 39.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 00:40:49,402 INFO L168 Benchmark]: RCFGBuilder took 580.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 111.7 MB). Peak memory consumption was 111.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:40:49,402 INFO L168 Benchmark]: TraceAbstraction took 39935.90 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 788.0 MB). Free memory was 943.1 MB in the beginning and 1.4 GB in the end (delta: -442.9 MB). Peak memory consumption was 975.2 MB. Max. memory is 11.5 GB. [2018-12-02 00:40:49,402 INFO L168 Benchmark]: Witness Printer took 179.90 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-12-02 00:40:49,404 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -111.3 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 580.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 111.7 MB). Peak memory consumption was 111.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39935.90 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 788.0 MB). Free memory was 943.1 MB in the beginning and 1.4 GB in the end (delta: -442.9 MB). Peak memory consumption was 975.2 MB. Max. memory is 11.5 GB. * Witness Printer took 179.90 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 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, 39.8s OverallTime, 65 OverallIterations, 2 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 25.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.2s 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.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2114 PreInvPairs, 2425 NumberOfFragments, 19233 HoareAnnotationTreeSize, 2114 FomulaSimplifications, 221365 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 142 FomulaSimplificationsInter, 441516 FormulaSimplificationTreeSizeReductionInter, 23.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s 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...