./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/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 8ad17193196daf327eee34f8d3cbf6704a80a533 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:59:26,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:59:26,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:59:26,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:59:26,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:59:26,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:59:26,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:59:26,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:59:26,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:59:26,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:59:26,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:59:26,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:59:26,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:59:26,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:59:26,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:59:26,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:59:26,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:59:26,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:59:26,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:59:26,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:59:26,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:59:26,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:59:26,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:59:26,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:59:26,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:59:26,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:59:26,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:59:26,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:59:26,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:59:26,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:59:26,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:59:26,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:59:26,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:59:26,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:59:26,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:59:26,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:59:26,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:59:26,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:59:26,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:59:26,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:59:26,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:59:26,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:59:26,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:59:26,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:59:26,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:59:26,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:59:26,249 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:59:26,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:59:26,249 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:59:26,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:59:26,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:59:26,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:59:26,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:59:26,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:59:26,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:59:26,250 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:59:26,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:59:26,250 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:59:26,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:59:26,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:59:26,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:59:26,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:59:26,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:59:26,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:59:26,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/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 -> 8ad17193196daf327eee34f8d3cbf6704a80a533 [2019-12-07 12:59:26,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:59:26,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:59:26,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:59:26,360 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:59:26,361 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:59:26,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-12-07 12:59:26,398 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/data/468593902/208803db12bc435ab2494a9b0d755816/FLAG3a4198287 [2019-12-07 12:59:26,866 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:59:26,866 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-12-07 12:59:26,878 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/data/468593902/208803db12bc435ab2494a9b0d755816/FLAG3a4198287 [2019-12-07 12:59:26,887 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/data/468593902/208803db12bc435ab2494a9b0d755816 [2019-12-07 12:59:26,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:59:26,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:59:26,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:26,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:59:26,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:59:26,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:26" (1/1) ... [2019-12-07 12:59:26,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3c6e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:26, skipping insertion in model container [2019-12-07 12:59:26,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:26" (1/1) ... [2019-12-07 12:59:26,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:59:26,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:59:27,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:27,168 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:59:27,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:27,244 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:59:27,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27 WrapperNode [2019-12-07 12:59:27,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:27,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:27,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:59:27,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:59:27,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:27,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:59:27,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:59:27,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:59:27,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... [2019-12-07 12:59:27,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:59:27,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:59:27,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:59:27,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:59:27,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/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 [2019-12-07 12:59:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:59:27,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:59:27,577 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,588 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,590 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,593 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,593 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,594 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,596 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,598 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,601 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,602 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,603 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,603 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,604 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,606 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,606 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,606 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,608 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,609 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,610 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,610 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,611 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,612 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,614 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,616 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,617 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,619 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,620 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,621 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,621 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:27,622 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:59:28,357 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-12-07 12:59:28,358 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-12-07 12:59:28,359 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-12-07 12:59:28,360 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-12-07 12:59:28,360 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-12-07 12:59:28,360 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-12-07 12:59:28,360 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-12-07 12:59:28,360 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-12-07 12:59:28,360 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-12-07 12:59:28,360 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-12-07 12:59:28,361 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-12-07 12:59:28,362 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-12-07 12:59:28,362 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-12-07 12:59:28,362 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-12-07 12:59:28,362 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-12-07 12:59:28,363 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-12-07 12:59:28,363 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-12-07 12:59:28,363 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-12-07 12:59:28,363 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-12-07 12:59:28,363 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-12-07 12:59:28,363 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-12-07 12:59:28,364 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-12-07 12:59:28,364 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-12-07 12:59:28,364 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-12-07 12:59:28,364 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-12-07 12:59:28,364 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-12-07 12:59:28,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-12-07 12:59:28,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-12-07 12:59:28,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-12-07 12:59:28,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-12-07 12:59:28,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-12-07 12:59:28,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-12-07 12:59:28,366 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-12-07 12:59:28,366 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-12-07 12:59:28,366 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-12-07 12:59:28,366 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-12-07 12:59:28,366 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-12-07 12:59:28,366 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-12-07 12:59:28,368 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:59:28,368 INFO L287 CfgBuilder]: Removed 275 assume(true) statements. [2019-12-07 12:59:28,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:28 BoogieIcfgContainer [2019-12-07 12:59:28,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:59:28,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:59:28,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:59:28,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:59:28,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:59:26" (1/3) ... [2019-12-07 12:59:28,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52384a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:28, skipping insertion in model container [2019-12-07 12:59:28,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:27" (2/3) ... [2019-12-07 12:59:28,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52384a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:28, skipping insertion in model container [2019-12-07 12:59:28,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:28" (3/3) ... [2019-12-07 12:59:28,376 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-12-07 12:59:28,385 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:59:28,392 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2019-12-07 12:59:28,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2019-12-07 12:59:28,420 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:59:28,420 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:59:28,421 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:59:28,421 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:59:28,421 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:59:28,421 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:59:28,421 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:59:28,421 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:59:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states. [2019-12-07 12:59:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:59:28,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:28,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:28,449 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:28,453 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2019-12-07 12:59:28,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:28,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001214511] [2019-12-07 12:59:28,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:28,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001214511] [2019-12-07 12:59:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:28,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:28,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243537109] [2019-12-07 12:59:28,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:28,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:28,599 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 3 states. [2019-12-07 12:59:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:28,841 INFO L93 Difference]: Finished difference Result 1130 states and 1620 transitions. [2019-12-07 12:59:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:28,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 12:59:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:28,858 INFO L225 Difference]: With dead ends: 1130 [2019-12-07 12:59:28,858 INFO L226 Difference]: Without dead ends: 686 [2019-12-07 12:59:28,863 INFO L630 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 [2019-12-07 12:59:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-12-07 12:59:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 663. [2019-12-07 12:59:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-07 12:59:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 902 transitions. [2019-12-07 12:59:28,930 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 902 transitions. Word has length 10 [2019-12-07 12:59:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:28,930 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 902 transitions. [2019-12-07 12:59:28,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 902 transitions. [2019-12-07 12:59:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:59:28,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:28,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:28,932 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-12-07 12:59:28,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:28,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353146852] [2019-12-07 12:59:28,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:28,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353146852] [2019-12-07 12:59:28,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:28,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:28,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060646459] [2019-12-07 12:59:28,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:28,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:28,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:28,974 INFO L87 Difference]: Start difference. First operand 663 states and 902 transitions. Second operand 3 states. [2019-12-07 12:59:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:29,005 INFO L93 Difference]: Finished difference Result 682 states and 924 transitions. [2019-12-07 12:59:29,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:29,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 12:59:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:29,010 INFO L225 Difference]: With dead ends: 682 [2019-12-07 12:59:29,010 INFO L226 Difference]: Without dead ends: 663 [2019-12-07 12:59:29,011 INFO L630 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 [2019-12-07 12:59:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-12-07 12:59:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-12-07 12:59:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-07 12:59:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 901 transitions. [2019-12-07 12:59:29,032 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 901 transitions. Word has length 11 [2019-12-07 12:59:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:29,032 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 901 transitions. [2019-12-07 12:59:29,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 901 transitions. [2019-12-07 12:59:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:59:29,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:29,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:29,034 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2019-12-07 12:59:29,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:29,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332842313] [2019-12-07 12:59:29,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:29,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332842313] [2019-12-07 12:59:29,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:29,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:29,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743117304] [2019-12-07 12:59:29,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:29,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:29,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:29,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:29,083 INFO L87 Difference]: Start difference. First operand 663 states and 901 transitions. Second operand 3 states. [2019-12-07 12:59:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:29,122 INFO L93 Difference]: Finished difference Result 756 states and 1015 transitions. [2019-12-07 12:59:29,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:29,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:59:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:29,126 INFO L225 Difference]: With dead ends: 756 [2019-12-07 12:59:29,126 INFO L226 Difference]: Without dead ends: 732 [2019-12-07 12:59:29,127 INFO L630 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 [2019-12-07 12:59:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-12-07 12:59:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 677. [2019-12-07 12:59:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-07 12:59:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 929 transitions. [2019-12-07 12:59:29,153 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 929 transitions. Word has length 16 [2019-12-07 12:59:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:29,153 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 929 transitions. [2019-12-07 12:59:29,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 929 transitions. [2019-12-07 12:59:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:59:29,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:29,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:29,156 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2019-12-07 12:59:29,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:29,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219647405] [2019-12-07 12:59:29,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:29,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219647405] [2019-12-07 12:59:29,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:29,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:29,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336029911] [2019-12-07 12:59:29,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:29,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:29,193 INFO L87 Difference]: Start difference. First operand 677 states and 929 transitions. Second operand 3 states. [2019-12-07 12:59:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:29,326 INFO L93 Difference]: Finished difference Result 705 states and 963 transitions. [2019-12-07 12:59:29,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:29,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:59:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:29,330 INFO L225 Difference]: With dead ends: 705 [2019-12-07 12:59:29,331 INFO L226 Difference]: Without dead ends: 700 [2019-12-07 12:59:29,331 INFO L630 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 [2019-12-07 12:59:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-12-07 12:59:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2019-12-07 12:59:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-12-07 12:59:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 958 transitions. [2019-12-07 12:59:29,356 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 958 transitions. Word has length 19 [2019-12-07 12:59:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:29,356 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 958 transitions. [2019-12-07 12:59:29,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 958 transitions. [2019-12-07 12:59:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:59:29,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:29,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:29,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:29,359 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2019-12-07 12:59:29,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:29,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4285494] [2019-12-07 12:59:29,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:29,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4285494] [2019-12-07 12:59:29,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:29,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:29,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765348814] [2019-12-07 12:59:29,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:29,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:29,397 INFO L87 Difference]: Start difference. First operand 700 states and 958 transitions. Second operand 3 states. [2019-12-07 12:59:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:29,454 INFO L93 Difference]: Finished difference Result 1205 states and 1636 transitions. [2019-12-07 12:59:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:29,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:59:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:29,459 INFO L225 Difference]: With dead ends: 1205 [2019-12-07 12:59:29,459 INFO L226 Difference]: Without dead ends: 843 [2019-12-07 12:59:29,460 INFO L630 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 [2019-12-07 12:59:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-12-07 12:59:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 682. [2019-12-07 12:59:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-07 12:59:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 934 transitions. [2019-12-07 12:59:29,487 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 934 transitions. Word has length 19 [2019-12-07 12:59:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:29,487 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 934 transitions. [2019-12-07 12:59:29,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 934 transitions. [2019-12-07 12:59:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:59:29,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:29,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:29,489 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:29,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:29,489 INFO L82 PathProgramCache]: Analyzing trace with hash -946930085, now seen corresponding path program 1 times [2019-12-07 12:59:29,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:29,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202610446] [2019-12-07 12:59:29,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:29,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202610446] [2019-12-07 12:59:29,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:29,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:29,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658156127] [2019-12-07 12:59:29,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:29,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:29,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:29,519 INFO L87 Difference]: Start difference. First operand 682 states and 934 transitions. Second operand 4 states. [2019-12-07 12:59:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:29,557 INFO L93 Difference]: Finished difference Result 694 states and 947 transitions. [2019-12-07 12:59:29,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:29,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 12:59:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:29,561 INFO L225 Difference]: With dead ends: 694 [2019-12-07 12:59:29,561 INFO L226 Difference]: Without dead ends: 674 [2019-12-07 12:59:29,562 INFO L630 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 [2019-12-07 12:59:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-12-07 12:59:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-12-07 12:59:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-12-07 12:59:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 924 transitions. [2019-12-07 12:59:29,586 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 924 transitions. Word has length 20 [2019-12-07 12:59:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:29,586 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 924 transitions. [2019-12-07 12:59:29,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 924 transitions. [2019-12-07 12:59:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:59:29,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:29,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:29,588 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2019-12-07 12:59:29,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:29,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801177561] [2019-12-07 12:59:29,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:29,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801177561] [2019-12-07 12:59:29,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:29,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:29,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37352731] [2019-12-07 12:59:29,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:29,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:29,616 INFO L87 Difference]: Start difference. First operand 674 states and 924 transitions. Second operand 3 states. [2019-12-07 12:59:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:29,766 INFO L93 Difference]: Finished difference Result 674 states and 924 transitions. [2019-12-07 12:59:29,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:29,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 12:59:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:29,770 INFO L225 Difference]: With dead ends: 674 [2019-12-07 12:59:29,770 INFO L226 Difference]: Without dead ends: 658 [2019-12-07 12:59:29,770 INFO L630 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 [2019-12-07 12:59:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-12-07 12:59:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-12-07 12:59:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-07 12:59:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 907 transitions. [2019-12-07 12:59:29,794 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 907 transitions. Word has length 23 [2019-12-07 12:59:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:29,794 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 907 transitions. [2019-12-07 12:59:29,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 907 transitions. [2019-12-07 12:59:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:59:29,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:29,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:29,796 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1059264480, now seen corresponding path program 1 times [2019-12-07 12:59:29,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:29,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694622620] [2019-12-07 12:59:29,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:29,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694622620] [2019-12-07 12:59:29,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:29,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:29,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100528099] [2019-12-07 12:59:29,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:29,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:29,831 INFO L87 Difference]: Start difference. First operand 658 states and 907 transitions. Second operand 4 states. [2019-12-07 12:59:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:29,864 INFO L93 Difference]: Finished difference Result 671 states and 921 transitions. [2019-12-07 12:59:29,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:29,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 12:59:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:29,866 INFO L225 Difference]: With dead ends: 671 [2019-12-07 12:59:29,866 INFO L226 Difference]: Without dead ends: 656 [2019-12-07 12:59:29,867 INFO L630 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 [2019-12-07 12:59:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-12-07 12:59:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-12-07 12:59:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-12-07 12:59:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-12-07 12:59:29,882 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 24 [2019-12-07 12:59:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:29,883 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-12-07 12:59:29,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-12-07 12:59:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:59:29,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:29,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:29,884 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:29,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2019-12-07 12:59:29,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:29,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104567343] [2019-12-07 12:59:29,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:29,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104567343] [2019-12-07 12:59:29,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:29,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:29,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982740800] [2019-12-07 12:59:29,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:29,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:29,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:29,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:29,909 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-12-07 12:59:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:30,048 INFO L93 Difference]: Finished difference Result 855 states and 1170 transitions. [2019-12-07 12:59:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:30,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 12:59:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:30,051 INFO L225 Difference]: With dead ends: 855 [2019-12-07 12:59:30,051 INFO L226 Difference]: Without dead ends: 847 [2019-12-07 12:59:30,052 INFO L630 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 [2019-12-07 12:59:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-12-07 12:59:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 674. [2019-12-07 12:59:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-12-07 12:59:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 931 transitions. [2019-12-07 12:59:30,070 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 931 transitions. Word has length 25 [2019-12-07 12:59:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:30,070 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 931 transitions. [2019-12-07 12:59:30,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 931 transitions. [2019-12-07 12:59:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:59:30,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:30,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:30,071 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 417423376, now seen corresponding path program 1 times [2019-12-07 12:59:30,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:30,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465011599] [2019-12-07 12:59:30,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:30,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465011599] [2019-12-07 12:59:30,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:30,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:59:30,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899825225] [2019-12-07 12:59:30,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:59:30,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:59:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:30,117 INFO L87 Difference]: Start difference. First operand 674 states and 931 transitions. Second operand 7 states. [2019-12-07 12:59:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:30,534 INFO L93 Difference]: Finished difference Result 998 states and 1339 transitions. [2019-12-07 12:59:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:30,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 12:59:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:30,538 INFO L225 Difference]: With dead ends: 998 [2019-12-07 12:59:30,538 INFO L226 Difference]: Without dead ends: 749 [2019-12-07 12:59:30,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:59:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-12-07 12:59:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 657. [2019-12-07 12:59:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-12-07 12:59:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 895 transitions. [2019-12-07 12:59:30,559 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 895 transitions. Word has length 26 [2019-12-07 12:59:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:30,559 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 895 transitions. [2019-12-07 12:59:30,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:59:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 895 transitions. [2019-12-07 12:59:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:59:30,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:30,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:30,561 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -65691980, now seen corresponding path program 1 times [2019-12-07 12:59:30,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:30,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639154478] [2019-12-07 12:59:30,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:30,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639154478] [2019-12-07 12:59:30,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:30,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:30,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211105368] [2019-12-07 12:59:30,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:30,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:30,583 INFO L87 Difference]: Start difference. First operand 657 states and 895 transitions. Second operand 4 states. [2019-12-07 12:59:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:30,618 INFO L93 Difference]: Finished difference Result 670 states and 909 transitions. [2019-12-07 12:59:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:30,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 12:59:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:30,621 INFO L225 Difference]: With dead ends: 670 [2019-12-07 12:59:30,621 INFO L226 Difference]: Without dead ends: 655 [2019-12-07 12:59:30,621 INFO L630 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 [2019-12-07 12:59:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-07 12:59:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-12-07 12:59:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-12-07 12:59:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 892 transitions. [2019-12-07 12:59:30,640 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 892 transitions. Word has length 26 [2019-12-07 12:59:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:30,640 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 892 transitions. [2019-12-07 12:59:30,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 892 transitions. [2019-12-07 12:59:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:59:30,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:30,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:30,641 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2019-12-07 12:59:30,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:30,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317085776] [2019-12-07 12:59:30,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:30,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317085776] [2019-12-07 12:59:30,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:30,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:30,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679911165] [2019-12-07 12:59:30,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:30,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:30,664 INFO L87 Difference]: Start difference. First operand 655 states and 892 transitions. Second operand 4 states. [2019-12-07 12:59:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:30,719 INFO L93 Difference]: Finished difference Result 693 states and 933 transitions. [2019-12-07 12:59:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:30,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 12:59:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:30,723 INFO L225 Difference]: With dead ends: 693 [2019-12-07 12:59:30,723 INFO L226 Difference]: Without dead ends: 672 [2019-12-07 12:59:30,723 INFO L630 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 [2019-12-07 12:59:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-07 12:59:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 657. [2019-12-07 12:59:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-12-07 12:59:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 894 transitions. [2019-12-07 12:59:30,750 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 894 transitions. Word has length 27 [2019-12-07 12:59:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:30,750 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 894 transitions. [2019-12-07 12:59:30,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 894 transitions. [2019-12-07 12:59:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:59:30,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:30,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:30,751 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:30,752 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2019-12-07 12:59:30,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:30,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285505449] [2019-12-07 12:59:30,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:30,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285505449] [2019-12-07 12:59:30,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:30,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:30,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697743337] [2019-12-07 12:59:30,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:30,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:30,775 INFO L87 Difference]: Start difference. First operand 657 states and 894 transitions. Second operand 3 states. [2019-12-07 12:59:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:30,815 INFO L93 Difference]: Finished difference Result 697 states and 943 transitions. [2019-12-07 12:59:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:30,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 12:59:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:30,818 INFO L225 Difference]: With dead ends: 697 [2019-12-07 12:59:30,818 INFO L226 Difference]: Without dead ends: 634 [2019-12-07 12:59:30,819 INFO L630 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 [2019-12-07 12:59:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-12-07 12:59:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-12-07 12:59:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-07 12:59:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-12-07 12:59:30,835 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 27 [2019-12-07 12:59:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:30,835 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-12-07 12:59:30,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-12-07 12:59:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:59:30,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:30,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:30,836 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2019-12-07 12:59:30,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:30,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290950891] [2019-12-07 12:59:30,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:30,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290950891] [2019-12-07 12:59:30,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:30,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:30,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850662091] [2019-12-07 12:59:30,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:30,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:30,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:30,858 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 4 states. [2019-12-07 12:59:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:30,903 INFO L93 Difference]: Finished difference Result 670 states and 898 transitions. [2019-12-07 12:59:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:30,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 12:59:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:30,906 INFO L225 Difference]: With dead ends: 670 [2019-12-07 12:59:30,906 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 12:59:30,907 INFO L630 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 [2019-12-07 12:59:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 12:59:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 632. [2019-12-07 12:59:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-07 12:59:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-12-07 12:59:30,932 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 28 [2019-12-07 12:59:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:30,933 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-12-07 12:59:30,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-12-07 12:59:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:59:30,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:30,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:30,934 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:30,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash 615415176, now seen corresponding path program 1 times [2019-12-07 12:59:30,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:30,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864972044] [2019-12-07 12:59:30,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:30,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864972044] [2019-12-07 12:59:30,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:30,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:59:30,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466067179] [2019-12-07 12:59:30,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:59:30,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:30,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:59:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:59:30,984 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 8 states. [2019-12-07 12:59:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:31,336 INFO L93 Difference]: Finished difference Result 654 states and 879 transitions. [2019-12-07 12:59:31,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:31,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 12:59:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:31,339 INFO L225 Difference]: With dead ends: 654 [2019-12-07 12:59:31,339 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 12:59:31,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:59:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 12:59:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 642. [2019-12-07 12:59:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 12:59:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 867 transitions. [2019-12-07 12:59:31,365 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 867 transitions. Word has length 29 [2019-12-07 12:59:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:31,366 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 867 transitions. [2019-12-07 12:59:31,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:59:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 867 transitions. [2019-12-07 12:59:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:59:31,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:31,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:31,367 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:31,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1368733509, now seen corresponding path program 1 times [2019-12-07 12:59:31,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:31,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127302032] [2019-12-07 12:59:31,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:31,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127302032] [2019-12-07 12:59:31,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:31,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:59:31,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570632475] [2019-12-07 12:59:31,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:59:31,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:59:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:59:31,417 INFO L87 Difference]: Start difference. First operand 642 states and 867 transitions. Second operand 8 states. [2019-12-07 12:59:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:31,751 INFO L93 Difference]: Finished difference Result 654 states and 878 transitions. [2019-12-07 12:59:31,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:31,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-07 12:59:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:31,753 INFO L225 Difference]: With dead ends: 654 [2019-12-07 12:59:31,754 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 12:59:31,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:59:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 12:59:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2019-12-07 12:59:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-12-07 12:59:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 868 transitions. [2019-12-07 12:59:31,773 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 868 transitions. Word has length 30 [2019-12-07 12:59:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:31,773 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 868 transitions. [2019-12-07 12:59:31,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:59:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 868 transitions. [2019-12-07 12:59:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:59:31,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:31,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:31,774 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:31,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1926882852, now seen corresponding path program 1 times [2019-12-07 12:59:31,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:31,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256832756] [2019-12-07 12:59:31,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:31,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256832756] [2019-12-07 12:59:31,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:31,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:31,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340474540] [2019-12-07 12:59:31,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:31,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:31,809 INFO L87 Difference]: Start difference. First operand 643 states and 868 transitions. Second operand 6 states. [2019-12-07 12:59:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:31,910 INFO L93 Difference]: Finished difference Result 697 states and 927 transitions. [2019-12-07 12:59:31,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:31,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 12:59:31,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:31,912 INFO L225 Difference]: With dead ends: 697 [2019-12-07 12:59:31,912 INFO L226 Difference]: Without dead ends: 640 [2019-12-07 12:59:31,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:59:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-07 12:59:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2019-12-07 12:59:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-12-07 12:59:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 827 transitions. [2019-12-07 12:59:31,931 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 827 transitions. Word has length 30 [2019-12-07 12:59:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:31,931 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 827 transitions. [2019-12-07 12:59:31,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 827 transitions. [2019-12-07 12:59:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:59:31,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:31,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:31,932 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:31,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:31,932 INFO L82 PathProgramCache]: Analyzing trace with hash 455111851, now seen corresponding path program 1 times [2019-12-07 12:59:31,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:31,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457695751] [2019-12-07 12:59:31,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:31,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457695751] [2019-12-07 12:59:31,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:31,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:59:31,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825901200] [2019-12-07 12:59:31,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:59:31,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:31,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:59:31,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:31,992 INFO L87 Difference]: Start difference. First operand 620 states and 827 transitions. Second operand 9 states. [2019-12-07 12:59:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:32,357 INFO L93 Difference]: Finished difference Result 637 states and 844 transitions. [2019-12-07 12:59:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:59:32,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 12:59:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:32,360 INFO L225 Difference]: With dead ends: 637 [2019-12-07 12:59:32,360 INFO L226 Difference]: Without dead ends: 632 [2019-12-07 12:59:32,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:59:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-12-07 12:59:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2019-12-07 12:59:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-12-07 12:59:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 826 transitions. [2019-12-07 12:59:32,385 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 826 transitions. Word has length 30 [2019-12-07 12:59:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:32,385 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 826 transitions. [2019-12-07 12:59:32,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:59:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 826 transitions. [2019-12-07 12:59:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:59:32,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:32,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:32,386 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2019-12-07 12:59:32,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:32,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001787542] [2019-12-07 12:59:32,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:32,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001787542] [2019-12-07 12:59:32,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:32,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:32,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454838546] [2019-12-07 12:59:32,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:32,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:32,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:32,411 INFO L87 Difference]: Start difference. First operand 620 states and 826 transitions. Second operand 3 states. [2019-12-07 12:59:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:32,536 INFO L93 Difference]: Finished difference Result 801 states and 1053 transitions. [2019-12-07 12:59:32,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:32,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:59:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:32,539 INFO L225 Difference]: With dead ends: 801 [2019-12-07 12:59:32,539 INFO L226 Difference]: Without dead ends: 778 [2019-12-07 12:59:32,539 INFO L630 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 [2019-12-07 12:59:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-12-07 12:59:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 658. [2019-12-07 12:59:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-07 12:59:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 869 transitions. [2019-12-07 12:59:32,567 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 869 transitions. Word has length 31 [2019-12-07 12:59:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:32,568 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 869 transitions. [2019-12-07 12:59:32,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 869 transitions. [2019-12-07 12:59:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:59:32,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:32,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:32,569 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:32,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:32,570 INFO L82 PathProgramCache]: Analyzing trace with hash 694297730, now seen corresponding path program 1 times [2019-12-07 12:59:32,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:32,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112537491] [2019-12-07 12:59:32,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:32,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112537491] [2019-12-07 12:59:32,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:32,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:59:32,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945702944] [2019-12-07 12:59:32,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:59:32,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:59:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:32,634 INFO L87 Difference]: Start difference. First operand 658 states and 869 transitions. Second operand 9 states. [2019-12-07 12:59:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:32,991 INFO L93 Difference]: Finished difference Result 675 states and 885 transitions. [2019-12-07 12:59:32,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:59:32,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-12-07 12:59:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:32,994 INFO L225 Difference]: With dead ends: 675 [2019-12-07 12:59:32,994 INFO L226 Difference]: Without dead ends: 670 [2019-12-07 12:59:32,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:59:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-07 12:59:33,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 658. [2019-12-07 12:59:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-07 12:59:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 868 transitions. [2019-12-07 12:59:33,019 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 868 transitions. Word has length 31 [2019-12-07 12:59:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:33,019 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 868 transitions. [2019-12-07 12:59:33,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:59:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 868 transitions. [2019-12-07 12:59:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:59:33,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:33,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:33,020 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:33,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2019-12-07 12:59:33,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:33,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895070647] [2019-12-07 12:59:33,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:33,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895070647] [2019-12-07 12:59:33,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:33,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:33,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955400513] [2019-12-07 12:59:33,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:33,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:33,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:33,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:33,052 INFO L87 Difference]: Start difference. First operand 658 states and 868 transitions. Second operand 3 states. [2019-12-07 12:59:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:33,198 INFO L93 Difference]: Finished difference Result 866 states and 1144 transitions. [2019-12-07 12:59:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:33,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:59:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:33,201 INFO L225 Difference]: With dead ends: 866 [2019-12-07 12:59:33,201 INFO L226 Difference]: Without dead ends: 660 [2019-12-07 12:59:33,202 INFO L630 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 [2019-12-07 12:59:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-07 12:59:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-12-07 12:59:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-12-07 12:59:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 871 transitions. [2019-12-07 12:59:33,222 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 871 transitions. Word has length 31 [2019-12-07 12:59:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:33,222 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 871 transitions. [2019-12-07 12:59:33,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 871 transitions. [2019-12-07 12:59:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:59:33,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:33,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:33,223 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1153548271, now seen corresponding path program 1 times [2019-12-07 12:59:33,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:33,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374907652] [2019-12-07 12:59:33,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:33,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374907652] [2019-12-07 12:59:33,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:33,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:33,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970027725] [2019-12-07 12:59:33,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:33,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:33,250 INFO L87 Difference]: Start difference. First operand 660 states and 871 transitions. Second operand 6 states. [2019-12-07 12:59:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:33,462 INFO L93 Difference]: Finished difference Result 1317 states and 1722 transitions. [2019-12-07 12:59:33,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:33,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 12:59:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:33,466 INFO L225 Difference]: With dead ends: 1317 [2019-12-07 12:59:33,466 INFO L226 Difference]: Without dead ends: 1044 [2019-12-07 12:59:33,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:59:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-12-07 12:59:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 723. [2019-12-07 12:59:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-12-07 12:59:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2019-12-07 12:59:33,490 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 32 [2019-12-07 12:59:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:33,491 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2019-12-07 12:59:33,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2019-12-07 12:59:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:59:33,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:33,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:33,492 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:33,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:33,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1153536355, now seen corresponding path program 1 times [2019-12-07 12:59:33,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:33,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894455497] [2019-12-07 12:59:33,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:33,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894455497] [2019-12-07 12:59:33,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:33,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:33,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164482499] [2019-12-07 12:59:33,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:33,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:33,525 INFO L87 Difference]: Start difference. First operand 723 states and 958 transitions. Second operand 6 states. [2019-12-07 12:59:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:33,712 INFO L93 Difference]: Finished difference Result 780 states and 1019 transitions. [2019-12-07 12:59:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:33,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 12:59:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:33,715 INFO L225 Difference]: With dead ends: 780 [2019-12-07 12:59:33,715 INFO L226 Difference]: Without dead ends: 764 [2019-12-07 12:59:33,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-07 12:59:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 719. [2019-12-07 12:59:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-07 12:59:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 952 transitions. [2019-12-07 12:59:33,741 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 952 transitions. Word has length 32 [2019-12-07 12:59:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:33,741 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 952 transitions. [2019-12-07 12:59:33,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 952 transitions. [2019-12-07 12:59:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:59:33,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:33,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:33,743 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash -311870270, now seen corresponding path program 1 times [2019-12-07 12:59:33,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:33,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107845209] [2019-12-07 12:59:33,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:33,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107845209] [2019-12-07 12:59:33,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:33,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:33,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108519067] [2019-12-07 12:59:33,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:33,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:33,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:33,771 INFO L87 Difference]: Start difference. First operand 719 states and 952 transitions. Second operand 6 states. [2019-12-07 12:59:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:33,838 INFO L93 Difference]: Finished difference Result 731 states and 963 transitions. [2019-12-07 12:59:33,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:59:33,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 12:59:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:33,842 INFO L225 Difference]: With dead ends: 731 [2019-12-07 12:59:33,842 INFO L226 Difference]: Without dead ends: 710 [2019-12-07 12:59:33,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-12-07 12:59:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2019-12-07 12:59:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2019-12-07 12:59:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 940 transitions. [2019-12-07 12:59:33,880 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 940 transitions. Word has length 32 [2019-12-07 12:59:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:33,880 INFO L462 AbstractCegarLoop]: Abstraction has 710 states and 940 transitions. [2019-12-07 12:59:33,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 940 transitions. [2019-12-07 12:59:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:59:33,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:33,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:33,881 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2019-12-07 12:59:33,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:33,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886924529] [2019-12-07 12:59:33,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:33,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886924529] [2019-12-07 12:59:33,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:33,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:33,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022237429] [2019-12-07 12:59:33,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:33,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:33,897 INFO L87 Difference]: Start difference. First operand 710 states and 940 transitions. Second operand 3 states. [2019-12-07 12:59:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:33,934 INFO L93 Difference]: Finished difference Result 893 states and 1175 transitions. [2019-12-07 12:59:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:33,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 12:59:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:33,937 INFO L225 Difference]: With dead ends: 893 [2019-12-07 12:59:33,937 INFO L226 Difference]: Without dead ends: 686 [2019-12-07 12:59:33,938 INFO L630 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 [2019-12-07 12:59:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-12-07 12:59:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2019-12-07 12:59:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-07 12:59:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 882 transitions. [2019-12-07 12:59:33,961 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 882 transitions. Word has length 32 [2019-12-07 12:59:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:33,961 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 882 transitions. [2019-12-07 12:59:33,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 882 transitions. [2019-12-07 12:59:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:59:33,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:33,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:33,962 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2019-12-07 12:59:33,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:33,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430602665] [2019-12-07 12:59:33,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:33,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430602665] [2019-12-07 12:59:33,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:33,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:33,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683695142] [2019-12-07 12:59:33,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:33,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:33,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:33,984 INFO L87 Difference]: Start difference. First operand 670 states and 882 transitions. Second operand 5 states. [2019-12-07 12:59:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:34,048 INFO L93 Difference]: Finished difference Result 771 states and 1000 transitions. [2019-12-07 12:59:34,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:34,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 12:59:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:34,052 INFO L225 Difference]: With dead ends: 771 [2019-12-07 12:59:34,052 INFO L226 Difference]: Without dead ends: 747 [2019-12-07 12:59:34,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-12-07 12:59:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 670. [2019-12-07 12:59:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-07 12:59:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 881 transitions. [2019-12-07 12:59:34,093 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 881 transitions. Word has length 33 [2019-12-07 12:59:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:34,093 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 881 transitions. [2019-12-07 12:59:34,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 881 transitions. [2019-12-07 12:59:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:59:34,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:34,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:34,095 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2019-12-07 12:59:34,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:34,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229346385] [2019-12-07 12:59:34,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:34,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229346385] [2019-12-07 12:59:34,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:34,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:34,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346964945] [2019-12-07 12:59:34,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:34,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:34,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:34,115 INFO L87 Difference]: Start difference. First operand 670 states and 881 transitions. Second operand 3 states. [2019-12-07 12:59:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:34,236 INFO L93 Difference]: Finished difference Result 808 states and 1046 transitions. [2019-12-07 12:59:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:34,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 12:59:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:34,239 INFO L225 Difference]: With dead ends: 808 [2019-12-07 12:59:34,239 INFO L226 Difference]: Without dead ends: 765 [2019-12-07 12:59:34,239 INFO L630 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 [2019-12-07 12:59:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-12-07 12:59:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 706. [2019-12-07 12:59:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-12-07 12:59:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 918 transitions. [2019-12-07 12:59:34,265 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 918 transitions. Word has length 33 [2019-12-07 12:59:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:34,265 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 918 transitions. [2019-12-07 12:59:34,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 918 transitions. [2019-12-07 12:59:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:59:34,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:34,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:34,266 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:34,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2019-12-07 12:59:34,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:34,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847054159] [2019-12-07 12:59:34,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:34,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847054159] [2019-12-07 12:59:34,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:34,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:34,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658949020] [2019-12-07 12:59:34,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:34,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:34,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:34,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:34,287 INFO L87 Difference]: Start difference. First operand 706 states and 918 transitions. Second operand 4 states. [2019-12-07 12:59:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:34,408 INFO L93 Difference]: Finished difference Result 725 states and 938 transitions. [2019-12-07 12:59:34,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:34,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 12:59:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:34,410 INFO L225 Difference]: With dead ends: 725 [2019-12-07 12:59:34,410 INFO L226 Difference]: Without dead ends: 599 [2019-12-07 12:59:34,411 INFO L630 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 [2019-12-07 12:59:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-07 12:59:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 587. [2019-12-07 12:59:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-07 12:59:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 755 transitions. [2019-12-07 12:59:34,434 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 755 transitions. Word has length 33 [2019-12-07 12:59:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:34,434 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 755 transitions. [2019-12-07 12:59:34,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 755 transitions. [2019-12-07 12:59:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:59:34,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:34,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:34,435 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1819353560, now seen corresponding path program 1 times [2019-12-07 12:59:34,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:34,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139039012] [2019-12-07 12:59:34,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:34,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139039012] [2019-12-07 12:59:34,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:34,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:59:34,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051776808] [2019-12-07 12:59:34,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:59:34,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:59:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:59:34,503 INFO L87 Difference]: Start difference. First operand 587 states and 755 transitions. Second operand 10 states. [2019-12-07 12:59:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:35,097 INFO L93 Difference]: Finished difference Result 668 states and 849 transitions. [2019-12-07 12:59:35,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:59:35,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-07 12:59:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:35,100 INFO L225 Difference]: With dead ends: 668 [2019-12-07 12:59:35,101 INFO L226 Difference]: Without dead ends: 652 [2019-12-07 12:59:35,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:59:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-07 12:59:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 589. [2019-12-07 12:59:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-12-07 12:59:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 757 transitions. [2019-12-07 12:59:35,141 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 757 transitions. Word has length 33 [2019-12-07 12:59:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:35,141 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 757 transitions. [2019-12-07 12:59:35,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:59:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 757 transitions. [2019-12-07 12:59:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:59:35,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:35,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:35,142 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash -471627368, now seen corresponding path program 1 times [2019-12-07 12:59:35,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:35,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913314972] [2019-12-07 12:59:35,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:35,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913314972] [2019-12-07 12:59:35,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:35,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:35,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322680557] [2019-12-07 12:59:35,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:35,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:35,167 INFO L87 Difference]: Start difference. First operand 589 states and 757 transitions. Second operand 5 states. [2019-12-07 12:59:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:35,341 INFO L93 Difference]: Finished difference Result 599 states and 766 transitions. [2019-12-07 12:59:35,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:35,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 12:59:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:35,343 INFO L225 Difference]: With dead ends: 599 [2019-12-07 12:59:35,344 INFO L226 Difference]: Without dead ends: 583 [2019-12-07 12:59:35,344 INFO L630 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 [2019-12-07 12:59:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-12-07 12:59:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 578. [2019-12-07 12:59:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-07 12:59:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 743 transitions. [2019-12-07 12:59:35,373 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 743 transitions. Word has length 33 [2019-12-07 12:59:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:35,373 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 743 transitions. [2019-12-07 12:59:35,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 743 transitions. [2019-12-07 12:59:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:59:35,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:35,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:35,374 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:35,374 INFO L82 PathProgramCache]: Analyzing trace with hash -935653763, now seen corresponding path program 1 times [2019-12-07 12:59:35,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:35,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792251553] [2019-12-07 12:59:35,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:35,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792251553] [2019-12-07 12:59:35,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:35,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:59:35,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239035614] [2019-12-07 12:59:35,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:59:35,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:59:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:35,433 INFO L87 Difference]: Start difference. First operand 578 states and 743 transitions. Second operand 9 states. [2019-12-07 12:59:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:36,122 INFO L93 Difference]: Finished difference Result 947 states and 1209 transitions. [2019-12-07 12:59:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:59:36,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 12:59:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:36,126 INFO L225 Difference]: With dead ends: 947 [2019-12-07 12:59:36,126 INFO L226 Difference]: Without dead ends: 924 [2019-12-07 12:59:36,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:59:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-12-07 12:59:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 576. [2019-12-07 12:59:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-07 12:59:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 739 transitions. [2019-12-07 12:59:36,158 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 739 transitions. Word has length 35 [2019-12-07 12:59:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:36,158 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 739 transitions. [2019-12-07 12:59:36,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:59:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 739 transitions. [2019-12-07 12:59:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:59:36,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:36,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:36,159 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:36,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:36,159 INFO L82 PathProgramCache]: Analyzing trace with hash 749897277, now seen corresponding path program 1 times [2019-12-07 12:59:36,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:36,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330515385] [2019-12-07 12:59:36,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:36,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330515385] [2019-12-07 12:59:36,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:36,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:36,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499827524] [2019-12-07 12:59:36,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:36,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:36,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:36,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:36,180 INFO L87 Difference]: Start difference. First operand 576 states and 739 transitions. Second operand 4 states. [2019-12-07 12:59:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:36,290 INFO L93 Difference]: Finished difference Result 637 states and 818 transitions. [2019-12-07 12:59:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:36,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 12:59:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:36,292 INFO L225 Difference]: With dead ends: 637 [2019-12-07 12:59:36,292 INFO L226 Difference]: Without dead ends: 598 [2019-12-07 12:59:36,293 INFO L630 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 [2019-12-07 12:59:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-12-07 12:59:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 542. [2019-12-07 12:59:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-07 12:59:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 701 transitions. [2019-12-07 12:59:36,319 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 701 transitions. Word has length 35 [2019-12-07 12:59:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:36,319 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 701 transitions. [2019-12-07 12:59:36,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2019-12-07 12:59:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:59:36,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:36,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:36,320 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:36,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2019-12-07 12:59:36,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:36,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053379440] [2019-12-07 12:59:36,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:36,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053379440] [2019-12-07 12:59:36,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:36,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:36,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568624707] [2019-12-07 12:59:36,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:36,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:36,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:36,350 INFO L87 Difference]: Start difference. First operand 542 states and 701 transitions. Second operand 5 states. [2019-12-07 12:59:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:36,526 INFO L93 Difference]: Finished difference Result 1248 states and 1619 transitions. [2019-12-07 12:59:36,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:36,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 12:59:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:36,529 INFO L225 Difference]: With dead ends: 1248 [2019-12-07 12:59:36,529 INFO L226 Difference]: Without dead ends: 1062 [2019-12-07 12:59:36,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:59:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-12-07 12:59:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 549. [2019-12-07 12:59:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-07 12:59:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 708 transitions. [2019-12-07 12:59:36,559 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 708 transitions. Word has length 35 [2019-12-07 12:59:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:36,559 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 708 transitions. [2019-12-07 12:59:36,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 708 transitions. [2019-12-07 12:59:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:59:36,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:36,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:36,560 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:36,561 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2019-12-07 12:59:36,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:36,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578091316] [2019-12-07 12:59:36,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:36,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578091316] [2019-12-07 12:59:36,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:36,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:36,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51681712] [2019-12-07 12:59:36,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:36,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:36,577 INFO L87 Difference]: Start difference. First operand 549 states and 708 transitions. Second operand 3 states. [2019-12-07 12:59:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:36,630 INFO L93 Difference]: Finished difference Result 809 states and 1043 transitions. [2019-12-07 12:59:36,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:36,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 12:59:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:36,633 INFO L225 Difference]: With dead ends: 809 [2019-12-07 12:59:36,633 INFO L226 Difference]: Without dead ends: 610 [2019-12-07 12:59:36,633 INFO L630 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 [2019-12-07 12:59:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-07 12:59:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 537. [2019-12-07 12:59:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-12-07 12:59:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 690 transitions. [2019-12-07 12:59:36,662 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 690 transitions. Word has length 36 [2019-12-07 12:59:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:36,663 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 690 transitions. [2019-12-07 12:59:36,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 690 transitions. [2019-12-07 12:59:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:59:36,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:36,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:36,663 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:36,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1515814519, now seen corresponding path program 1 times [2019-12-07 12:59:36,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:36,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652210767] [2019-12-07 12:59:36,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:36,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652210767] [2019-12-07 12:59:36,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:36,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:36,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225782363] [2019-12-07 12:59:36,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:36,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:36,686 INFO L87 Difference]: Start difference. First operand 537 states and 690 transitions. Second operand 5 states. [2019-12-07 12:59:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:36,762 INFO L93 Difference]: Finished difference Result 553 states and 706 transitions. [2019-12-07 12:59:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:36,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 12:59:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:36,765 INFO L225 Difference]: With dead ends: 553 [2019-12-07 12:59:36,765 INFO L226 Difference]: Without dead ends: 536 [2019-12-07 12:59:36,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-07 12:59:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-12-07 12:59:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-07 12:59:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 688 transitions. [2019-12-07 12:59:36,797 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 688 transitions. Word has length 37 [2019-12-07 12:59:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:36,797 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 688 transitions. [2019-12-07 12:59:36,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 688 transitions. [2019-12-07 12:59:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:59:36,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:36,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:36,798 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash -604803074, now seen corresponding path program 1 times [2019-12-07 12:59:36,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:36,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512823680] [2019-12-07 12:59:36,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:36,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512823680] [2019-12-07 12:59:36,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:36,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:36,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540350198] [2019-12-07 12:59:36,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:36,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:36,820 INFO L87 Difference]: Start difference. First operand 536 states and 688 transitions. Second operand 6 states. [2019-12-07 12:59:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:36,989 INFO L93 Difference]: Finished difference Result 564 states and 714 transitions. [2019-12-07 12:59:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:36,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 12:59:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:36,991 INFO L225 Difference]: With dead ends: 564 [2019-12-07 12:59:36,991 INFO L226 Difference]: Without dead ends: 530 [2019-12-07 12:59:36,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-07 12:59:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 520. [2019-12-07 12:59:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-12-07 12:59:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2019-12-07 12:59:37,029 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 37 [2019-12-07 12:59:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:37,029 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2019-12-07 12:59:37,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2019-12-07 12:59:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:59:37,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:37,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:37,030 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2019-12-07 12:59:37,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:37,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386358743] [2019-12-07 12:59:37,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:37,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386358743] [2019-12-07 12:59:37,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:37,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:37,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188440694] [2019-12-07 12:59:37,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:37,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:37,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:37,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:37,109 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand 4 states. [2019-12-07 12:59:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:37,183 INFO L93 Difference]: Finished difference Result 709 states and 910 transitions. [2019-12-07 12:59:37,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:37,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 12:59:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:37,185 INFO L225 Difference]: With dead ends: 709 [2019-12-07 12:59:37,185 INFO L226 Difference]: Without dead ends: 490 [2019-12-07 12:59:37,186 INFO L630 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 [2019-12-07 12:59:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-07 12:59:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 485. [2019-12-07 12:59:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-12-07 12:59:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 617 transitions. [2019-12-07 12:59:37,223 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 617 transitions. Word has length 37 [2019-12-07 12:59:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:37,223 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 617 transitions. [2019-12-07 12:59:37,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 617 transitions. [2019-12-07 12:59:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:59:37,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:37,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:37,224 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2019-12-07 12:59:37,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:37,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808269809] [2019-12-07 12:59:37,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:37,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808269809] [2019-12-07 12:59:37,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:37,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:37,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970854360] [2019-12-07 12:59:37,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:37,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:37,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:37,251 INFO L87 Difference]: Start difference. First operand 485 states and 617 transitions. Second operand 4 states. [2019-12-07 12:59:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:37,376 INFO L93 Difference]: Finished difference Result 666 states and 850 transitions. [2019-12-07 12:59:37,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:37,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-07 12:59:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:37,378 INFO L225 Difference]: With dead ends: 666 [2019-12-07 12:59:37,378 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 12:59:37,379 INFO L630 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 [2019-12-07 12:59:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 12:59:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-12-07 12:59:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-07 12:59:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 608 transitions. [2019-12-07 12:59:37,416 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 608 transitions. Word has length 38 [2019-12-07 12:59:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:37,416 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 608 transitions. [2019-12-07 12:59:37,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 608 transitions. [2019-12-07 12:59:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:59:37,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:37,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:37,417 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash -147578755, now seen corresponding path program 1 times [2019-12-07 12:59:37,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:37,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14312811] [2019-12-07 12:59:37,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:37,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14312811] [2019-12-07 12:59:37,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:37,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:37,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702885828] [2019-12-07 12:59:37,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:37,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:37,432 INFO L87 Difference]: Start difference. First operand 482 states and 608 transitions. Second operand 3 states. [2019-12-07 12:59:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:37,556 INFO L93 Difference]: Finished difference Result 843 states and 1061 transitions. [2019-12-07 12:59:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:37,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 12:59:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:37,559 INFO L225 Difference]: With dead ends: 843 [2019-12-07 12:59:37,559 INFO L226 Difference]: Without dead ends: 662 [2019-12-07 12:59:37,559 INFO L630 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 [2019-12-07 12:59:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-07 12:59:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 485. [2019-12-07 12:59:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-12-07 12:59:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 611 transitions. [2019-12-07 12:59:37,596 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 611 transitions. Word has length 41 [2019-12-07 12:59:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:37,596 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 611 transitions. [2019-12-07 12:59:37,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 611 transitions. [2019-12-07 12:59:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:59:37,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:37,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:37,597 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2019-12-07 12:59:37,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:37,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536918928] [2019-12-07 12:59:37,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:37,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536918928] [2019-12-07 12:59:37,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:37,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:37,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217312534] [2019-12-07 12:59:37,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:37,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:37,632 INFO L87 Difference]: Start difference. First operand 485 states and 611 transitions. Second operand 5 states. [2019-12-07 12:59:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:37,807 INFO L93 Difference]: Finished difference Result 828 states and 1031 transitions. [2019-12-07 12:59:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:59:37,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 12:59:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:37,809 INFO L225 Difference]: With dead ends: 828 [2019-12-07 12:59:37,809 INFO L226 Difference]: Without dead ends: 672 [2019-12-07 12:59:37,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-07 12:59:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 485. [2019-12-07 12:59:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-12-07 12:59:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 607 transitions. [2019-12-07 12:59:37,843 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 607 transitions. Word has length 41 [2019-12-07 12:59:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:37,843 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 607 transitions. [2019-12-07 12:59:37,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 607 transitions. [2019-12-07 12:59:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:59:37,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:37,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:37,844 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2019-12-07 12:59:37,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:37,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674311401] [2019-12-07 12:59:37,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:37,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674311401] [2019-12-07 12:59:37,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:37,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:37,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779810565] [2019-12-07 12:59:37,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:37,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:37,862 INFO L87 Difference]: Start difference. First operand 485 states and 607 transitions. Second operand 4 states. [2019-12-07 12:59:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:37,924 INFO L93 Difference]: Finished difference Result 657 states and 807 transitions. [2019-12-07 12:59:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:37,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 12:59:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:37,926 INFO L225 Difference]: With dead ends: 657 [2019-12-07 12:59:37,926 INFO L226 Difference]: Without dead ends: 580 [2019-12-07 12:59:37,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-07 12:59:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 489. [2019-12-07 12:59:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-12-07 12:59:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 611 transitions. [2019-12-07 12:59:37,960 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 611 transitions. Word has length 42 [2019-12-07 12:59:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:37,960 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 611 transitions. [2019-12-07 12:59:37,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 611 transitions. [2019-12-07 12:59:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:59:37,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:37,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:37,961 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2019-12-07 12:59:37,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:37,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801471005] [2019-12-07 12:59:37,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:37,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801471005] [2019-12-07 12:59:37,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:37,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:59:37,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283229262] [2019-12-07 12:59:37,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:59:37,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:37,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:59:37,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:37,992 INFO L87 Difference]: Start difference. First operand 489 states and 611 transitions. Second operand 7 states. [2019-12-07 12:59:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:38,101 INFO L93 Difference]: Finished difference Result 635 states and 779 transitions. [2019-12-07 12:59:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:38,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 12:59:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:38,102 INFO L225 Difference]: With dead ends: 635 [2019-12-07 12:59:38,102 INFO L226 Difference]: Without dead ends: 536 [2019-12-07 12:59:38,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:59:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-07 12:59:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 484. [2019-12-07 12:59:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 12:59:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 602 transitions. [2019-12-07 12:59:38,136 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 602 transitions. Word has length 42 [2019-12-07 12:59:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:38,136 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 602 transitions. [2019-12-07 12:59:38,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:59:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 602 transitions. [2019-12-07 12:59:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:59:38,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:38,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:38,137 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash -823105571, now seen corresponding path program 1 times [2019-12-07 12:59:38,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:38,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862542331] [2019-12-07 12:59:38,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:38,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862542331] [2019-12-07 12:59:38,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:38,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:59:38,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655865692] [2019-12-07 12:59:38,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:59:38,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:38,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:59:38,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:38,168 INFO L87 Difference]: Start difference. First operand 484 states and 602 transitions. Second operand 7 states. [2019-12-07 12:59:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:38,356 INFO L93 Difference]: Finished difference Result 512 states and 628 transitions. [2019-12-07 12:59:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:38,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 12:59:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:38,357 INFO L225 Difference]: With dead ends: 512 [2019-12-07 12:59:38,357 INFO L226 Difference]: Without dead ends: 346 [2019-12-07 12:59:38,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:59:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-07 12:59:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2019-12-07 12:59:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 12:59:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 399 transitions. [2019-12-07 12:59:38,379 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 399 transitions. Word has length 42 [2019-12-07 12:59:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:38,380 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 399 transitions. [2019-12-07 12:59:38,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:59:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 399 transitions. [2019-12-07 12:59:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:59:38,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:38,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:38,380 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2019-12-07 12:59:38,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:38,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015312761] [2019-12-07 12:59:38,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:38,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015312761] [2019-12-07 12:59:38,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:38,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:38,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285494114] [2019-12-07 12:59:38,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:38,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:38,422 INFO L87 Difference]: Start difference. First operand 323 states and 399 transitions. Second operand 5 states. [2019-12-07 12:59:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:38,536 INFO L93 Difference]: Finished difference Result 707 states and 889 transitions. [2019-12-07 12:59:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:38,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-07 12:59:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:38,537 INFO L225 Difference]: With dead ends: 707 [2019-12-07 12:59:38,537 INFO L226 Difference]: Without dead ends: 577 [2019-12-07 12:59:38,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:59:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-07 12:59:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 323. [2019-12-07 12:59:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 12:59:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 398 transitions. [2019-12-07 12:59:38,561 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 398 transitions. Word has length 44 [2019-12-07 12:59:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:38,561 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 398 transitions. [2019-12-07 12:59:38,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 398 transitions. [2019-12-07 12:59:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 12:59:38,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:38,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:38,562 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash -702658274, now seen corresponding path program 1 times [2019-12-07 12:59:38,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:38,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362815291] [2019-12-07 12:59:38,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:38,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362815291] [2019-12-07 12:59:38,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:38,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:38,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270516592] [2019-12-07 12:59:38,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:38,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:38,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:38,582 INFO L87 Difference]: Start difference. First operand 323 states and 398 transitions. Second operand 4 states. [2019-12-07 12:59:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:38,620 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2019-12-07 12:59:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:38,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 12:59:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:38,621 INFO L225 Difference]: With dead ends: 355 [2019-12-07 12:59:38,621 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 12:59:38,622 INFO L630 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 [2019-12-07 12:59:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 12:59:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-12-07 12:59:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-07 12:59:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 396 transitions. [2019-12-07 12:59:38,645 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 396 transitions. Word has length 47 [2019-12-07 12:59:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:38,645 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 396 transitions. [2019-12-07 12:59:38,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 396 transitions. [2019-12-07 12:59:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 12:59:38,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:38,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:38,645 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1085716830, now seen corresponding path program 1 times [2019-12-07 12:59:38,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:38,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548693868] [2019-12-07 12:59:38,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:38,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548693868] [2019-12-07 12:59:38,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:38,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:59:38,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954160347] [2019-12-07 12:59:38,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:59:38,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:38,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:59:38,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:38,677 INFO L87 Difference]: Start difference. First operand 322 states and 396 transitions. Second operand 7 states. [2019-12-07 12:59:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:38,748 INFO L93 Difference]: Finished difference Result 327 states and 400 transitions. [2019-12-07 12:59:38,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:59:38,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 12:59:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:38,749 INFO L225 Difference]: With dead ends: 327 [2019-12-07 12:59:38,749 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 12:59:38,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:59:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 12:59:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-12-07 12:59:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-12-07 12:59:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2019-12-07 12:59:38,771 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 47 [2019-12-07 12:59:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:38,771 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2019-12-07 12:59:38,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:59:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2019-12-07 12:59:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 12:59:38,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:38,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:38,772 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2019-12-07 12:59:38,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:38,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405545419] [2019-12-07 12:59:38,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:38,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405545419] [2019-12-07 12:59:38,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:38,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:59:38,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745203102] [2019-12-07 12:59:38,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:38,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:38,786 INFO L87 Difference]: Start difference. First operand 261 states and 321 transitions. Second operand 3 states. [2019-12-07 12:59:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:38,838 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2019-12-07 12:59:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:38,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 12:59:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:38,839 INFO L225 Difference]: With dead ends: 394 [2019-12-07 12:59:38,839 INFO L226 Difference]: Without dead ends: 223 [2019-12-07 12:59:38,839 INFO L630 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 [2019-12-07 12:59:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-12-07 12:59:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-12-07 12:59:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 12:59:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-12-07 12:59:38,857 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 48 [2019-12-07 12:59:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:38,857 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-12-07 12:59:38,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-12-07 12:59:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 12:59:38,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:38,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:38,858 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash -624507704, now seen corresponding path program 1 times [2019-12-07 12:59:38,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:38,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378841894] [2019-12-07 12:59:38,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:38,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378841894] [2019-12-07 12:59:38,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:38,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:59:38,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873659664] [2019-12-07 12:59:38,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:59:38,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:38,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:59:38,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:38,890 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 7 states. [2019-12-07 12:59:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:39,005 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2019-12-07 12:59:39,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:59:39,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 12:59:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:39,005 INFO L225 Difference]: With dead ends: 313 [2019-12-07 12:59:39,006 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 12:59:39,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:59:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 12:59:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 223. [2019-12-07 12:59:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 12:59:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 271 transitions. [2019-12-07 12:59:39,024 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 271 transitions. Word has length 54 [2019-12-07 12:59:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:39,024 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 271 transitions. [2019-12-07 12:59:39,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:59:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 271 transitions. [2019-12-07 12:59:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:59:39,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:39,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:39,025 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2071877734, now seen corresponding path program 1 times [2019-12-07 12:59:39,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:39,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207395794] [2019-12-07 12:59:39,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:39,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207395794] [2019-12-07 12:59:39,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:39,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:59:39,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98113950] [2019-12-07 12:59:39,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:59:39,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:59:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:59:39,065 INFO L87 Difference]: Start difference. First operand 223 states and 271 transitions. Second operand 8 states. [2019-12-07 12:59:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:39,162 INFO L93 Difference]: Finished difference Result 289 states and 351 transitions. [2019-12-07 12:59:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:39,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-07 12:59:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:39,163 INFO L225 Difference]: With dead ends: 289 [2019-12-07 12:59:39,163 INFO L226 Difference]: Without dead ends: 223 [2019-12-07 12:59:39,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:59:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-12-07 12:59:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-12-07 12:59:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 12:59:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 270 transitions. [2019-12-07 12:59:39,182 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 270 transitions. Word has length 59 [2019-12-07 12:59:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:39,182 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 270 transitions. [2019-12-07 12:59:39,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:59:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2019-12-07 12:59:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:59:39,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:39,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:39,183 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash -121361867, now seen corresponding path program 1 times [2019-12-07 12:59:39,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:39,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102369121] [2019-12-07 12:59:39,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:39,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102369121] [2019-12-07 12:59:39,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:39,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:39,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341265745] [2019-12-07 12:59:39,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:39,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:39,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:39,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:39,207 INFO L87 Difference]: Start difference. First operand 223 states and 270 transitions. Second operand 5 states. [2019-12-07 12:59:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:39,286 INFO L93 Difference]: Finished difference Result 378 states and 455 transitions. [2019-12-07 12:59:39,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:59:39,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 12:59:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:39,286 INFO L225 Difference]: With dead ends: 378 [2019-12-07 12:59:39,287 INFO L226 Difference]: Without dead ends: 327 [2019-12-07 12:59:39,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-07 12:59:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 190. [2019-12-07 12:59:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-07 12:59:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2019-12-07 12:59:39,303 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 59 [2019-12-07 12:59:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:39,303 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2019-12-07 12:59:39,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2019-12-07 12:59:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:59:39,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:39,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:39,304 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1291714983, now seen corresponding path program 1 times [2019-12-07 12:59:39,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:39,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452396617] [2019-12-07 12:59:39,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:39,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452396617] [2019-12-07 12:59:39,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:39,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:39,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908030500] [2019-12-07 12:59:39,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:39,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:39,329 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand 5 states. [2019-12-07 12:59:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:39,396 INFO L93 Difference]: Finished difference Result 278 states and 328 transitions. [2019-12-07 12:59:39,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:39,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-07 12:59:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:39,397 INFO L225 Difference]: With dead ends: 278 [2019-12-07 12:59:39,397 INFO L226 Difference]: Without dead ends: 244 [2019-12-07 12:59:39,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-07 12:59:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2019-12-07 12:59:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 12:59:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 209 transitions. [2019-12-07 12:59:39,413 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 209 transitions. Word has length 60 [2019-12-07 12:59:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:39,413 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 209 transitions. [2019-12-07 12:59:39,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2019-12-07 12:59:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 12:59:39,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:39,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:39,414 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:39,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:39,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1525268266, now seen corresponding path program 1 times [2019-12-07 12:59:39,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:39,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535238692] [2019-12-07 12:59:39,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:39,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535238692] [2019-12-07 12:59:39,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:39,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:39,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449001593] [2019-12-07 12:59:39,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:39,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:39,439 INFO L87 Difference]: Start difference. First operand 179 states and 209 transitions. Second operand 6 states. [2019-12-07 12:59:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:39,511 INFO L93 Difference]: Finished difference Result 324 states and 382 transitions. [2019-12-07 12:59:39,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:39,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-07 12:59:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:39,511 INFO L225 Difference]: With dead ends: 324 [2019-12-07 12:59:39,511 INFO L226 Difference]: Without dead ends: 269 [2019-12-07 12:59:39,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:59:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-07 12:59:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 146. [2019-12-07 12:59:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 12:59:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2019-12-07 12:59:39,527 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 61 [2019-12-07 12:59:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:39,527 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2019-12-07 12:59:39,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2019-12-07 12:59:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 12:59:39,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:39,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:39,528 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1218638889, now seen corresponding path program 1 times [2019-12-07 12:59:39,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:39,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462292377] [2019-12-07 12:59:39,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:39,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462292377] [2019-12-07 12:59:39,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:39,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:59:39,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935134197] [2019-12-07 12:59:39,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:59:39,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:59:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:39,577 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand 7 states. [2019-12-07 12:59:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:39,703 INFO L93 Difference]: Finished difference Result 376 states and 447 transitions. [2019-12-07 12:59:39,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:59:39,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-07 12:59:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:39,704 INFO L225 Difference]: With dead ends: 376 [2019-12-07 12:59:39,704 INFO L226 Difference]: Without dead ends: 356 [2019-12-07 12:59:39,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:59:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-07 12:59:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 162. [2019-12-07 12:59:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 12:59:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2019-12-07 12:59:39,721 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 74 [2019-12-07 12:59:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:39,721 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2019-12-07 12:59:39,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:59:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2019-12-07 12:59:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 12:59:39,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:39,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:39,722 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:39,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:39,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1172490426, now seen corresponding path program 1 times [2019-12-07 12:59:39,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:39,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16139829] [2019-12-07 12:59:39,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:39,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16139829] [2019-12-07 12:59:39,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:39,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:59:39,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621977660] [2019-12-07 12:59:39,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:59:39,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:59:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:59:39,779 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand 11 states. [2019-12-07 12:59:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:40,009 INFO L93 Difference]: Finished difference Result 358 states and 429 transitions. [2019-12-07 12:59:40,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:59:40,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-12-07 12:59:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:40,010 INFO L225 Difference]: With dead ends: 358 [2019-12-07 12:59:40,010 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 12:59:40,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:59:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 12:59:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 162. [2019-12-07 12:59:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 12:59:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-12-07 12:59:40,027 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 75 [2019-12-07 12:59:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:40,027 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-12-07 12:59:40,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:59:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-12-07 12:59:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 12:59:40,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:40,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:40,028 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash 645027120, now seen corresponding path program 1 times [2019-12-07 12:59:40,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:40,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613514148] [2019-12-07 12:59:40,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:40,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613514148] [2019-12-07 12:59:40,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:40,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:40,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302136674] [2019-12-07 12:59:40,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:40,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:40,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:40,055 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 4 states. [2019-12-07 12:59:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:40,090 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2019-12-07 12:59:40,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:40,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-07 12:59:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:40,091 INFO L225 Difference]: With dead ends: 215 [2019-12-07 12:59:40,091 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 12:59:40,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 12:59:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 162. [2019-12-07 12:59:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 12:59:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-12-07 12:59:40,108 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 79 [2019-12-07 12:59:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:40,108 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-12-07 12:59:40,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-12-07 12:59:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 12:59:40,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:40,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:40,109 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1091776138, now seen corresponding path program 1 times [2019-12-07 12:59:40,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:40,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580729862] [2019-12-07 12:59:40,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:40,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580729862] [2019-12-07 12:59:40,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:40,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:40,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785413528] [2019-12-07 12:59:40,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:40,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:40,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:40,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:40,141 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 6 states. [2019-12-07 12:59:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:40,208 INFO L93 Difference]: Finished difference Result 277 states and 333 transitions. [2019-12-07 12:59:40,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:59:40,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-07 12:59:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:40,209 INFO L225 Difference]: With dead ends: 277 [2019-12-07 12:59:40,209 INFO L226 Difference]: Without dead ends: 212 [2019-12-07 12:59:40,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:59:40,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-07 12:59:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 152. [2019-12-07 12:59:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 12:59:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2019-12-07 12:59:40,225 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 80 [2019-12-07 12:59:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:40,225 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2019-12-07 12:59:40,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2019-12-07 12:59:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 12:59:40,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:40,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:40,226 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -839306980, now seen corresponding path program 1 times [2019-12-07 12:59:40,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:40,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143629467] [2019-12-07 12:59:40,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:40,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143629467] [2019-12-07 12:59:40,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:40,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:59:40,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761463946] [2019-12-07 12:59:40,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:59:40,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:40,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:59:40,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:59:40,284 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand 10 states. [2019-12-07 12:59:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:40,448 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2019-12-07 12:59:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:59:40,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-12-07 12:59:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:40,448 INFO L225 Difference]: With dead ends: 381 [2019-12-07 12:59:40,448 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:59:40,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:59:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:59:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 219. [2019-12-07 12:59:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 12:59:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2019-12-07 12:59:40,469 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 81 [2019-12-07 12:59:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:40,470 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2019-12-07 12:59:40,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:59:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2019-12-07 12:59:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 12:59:40,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:40,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:40,470 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:40,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash -273318, now seen corresponding path program 1 times [2019-12-07 12:59:40,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:40,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829483862] [2019-12-07 12:59:40,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:40,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829483862] [2019-12-07 12:59:40,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:40,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:59:40,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524991260] [2019-12-07 12:59:40,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:59:40,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:59:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:59:40,507 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand 6 states. [2019-12-07 12:59:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:40,622 INFO L93 Difference]: Finished difference Result 400 states and 466 transitions. [2019-12-07 12:59:40,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:59:40,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-07 12:59:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:40,622 INFO L225 Difference]: With dead ends: 400 [2019-12-07 12:59:40,622 INFO L226 Difference]: Without dead ends: 380 [2019-12-07 12:59:40,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:59:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-07 12:59:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2019-12-07 12:59:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 12:59:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2019-12-07 12:59:40,644 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 81 [2019-12-07 12:59:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:40,644 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2019-12-07 12:59:40,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:59:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2019-12-07 12:59:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 12:59:40,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:40,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:40,645 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 288160049, now seen corresponding path program 1 times [2019-12-07 12:59:40,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:40,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675466068] [2019-12-07 12:59:40,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:40,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675466068] [2019-12-07 12:59:40,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:40,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:59:40,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962605775] [2019-12-07 12:59:40,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:59:40,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:59:40,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:59:40,678 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand 5 states. [2019-12-07 12:59:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:40,746 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2019-12-07 12:59:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:59:40,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-07 12:59:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:40,747 INFO L225 Difference]: With dead ends: 314 [2019-12-07 12:59:40,747 INFO L226 Difference]: Without dead ends: 274 [2019-12-07 12:59:40,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:59:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-12-07 12:59:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 214. [2019-12-07 12:59:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 12:59:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2019-12-07 12:59:40,774 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 244 transitions. Word has length 84 [2019-12-07 12:59:40,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:40,774 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 244 transitions. [2019-12-07 12:59:40,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:59:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 244 transitions. [2019-12-07 12:59:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 12:59:40,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:40,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:40,775 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:40,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:40,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1873856217, now seen corresponding path program 1 times [2019-12-07 12:59:40,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:40,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360817539] [2019-12-07 12:59:40,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:40,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360817539] [2019-12-07 12:59:40,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:40,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:40,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6415100] [2019-12-07 12:59:40,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:40,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:40,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:40,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:40,800 INFO L87 Difference]: Start difference. First operand 214 states and 244 transitions. Second operand 4 states. [2019-12-07 12:59:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:40,839 INFO L93 Difference]: Finished difference Result 262 states and 294 transitions. [2019-12-07 12:59:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:40,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 12:59:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:40,840 INFO L225 Difference]: With dead ends: 262 [2019-12-07 12:59:40,840 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 12:59:40,840 INFO L630 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 [2019-12-07 12:59:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 12:59:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2019-12-07 12:59:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 12:59:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 246 transitions. [2019-12-07 12:59:40,870 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 246 transitions. Word has length 86 [2019-12-07 12:59:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:40,870 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 246 transitions. [2019-12-07 12:59:40,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2019-12-07 12:59:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 12:59:40,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:40,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:40,871 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:40,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash 481659239, now seen corresponding path program 1 times [2019-12-07 12:59:40,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:40,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665064149] [2019-12-07 12:59:40,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:40,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665064149] [2019-12-07 12:59:40,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:40,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:59:40,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423168175] [2019-12-07 12:59:40,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:59:40,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:40,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:59:40,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:40,926 INFO L87 Difference]: Start difference. First operand 216 states and 246 transitions. Second operand 9 states. [2019-12-07 12:59:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:41,186 INFO L93 Difference]: Finished difference Result 426 states and 492 transitions. [2019-12-07 12:59:41,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 12:59:41,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 12:59:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:41,187 INFO L225 Difference]: With dead ends: 426 [2019-12-07 12:59:41,187 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 12:59:41,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:59:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 12:59:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 213. [2019-12-07 12:59:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-07 12:59:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 239 transitions. [2019-12-07 12:59:41,209 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 239 transitions. Word has length 86 [2019-12-07 12:59:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:41,209 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 239 transitions. [2019-12-07 12:59:41,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:59:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2019-12-07 12:59:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 12:59:41,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:41,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:41,210 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1016683280, now seen corresponding path program 1 times [2019-12-07 12:59:41,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:41,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158522212] [2019-12-07 12:59:41,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:41,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158522212] [2019-12-07 12:59:41,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:41,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:59:41,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674940195] [2019-12-07 12:59:41,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:59:41,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:59:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:59:41,270 INFO L87 Difference]: Start difference. First operand 213 states and 239 transitions. Second operand 12 states. [2019-12-07 12:59:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:41,670 INFO L93 Difference]: Finished difference Result 392 states and 442 transitions. [2019-12-07 12:59:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 12:59:41,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-12-07 12:59:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:41,672 INFO L225 Difference]: With dead ends: 392 [2019-12-07 12:59:41,672 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 12:59:41,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2019-12-07 12:59:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 12:59:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 220. [2019-12-07 12:59:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-07 12:59:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2019-12-07 12:59:41,705 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 87 [2019-12-07 12:59:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:41,705 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2019-12-07 12:59:41,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:59:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2019-12-07 12:59:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 12:59:41,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:41,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:41,706 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash 895193670, now seen corresponding path program 1 times [2019-12-07 12:59:41,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:41,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087940876] [2019-12-07 12:59:41,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:41,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087940876] [2019-12-07 12:59:41,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:41,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:59:41,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182976213] [2019-12-07 12:59:41,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:59:41,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:59:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:59:41,750 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 9 states. [2019-12-07 12:59:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:41,939 INFO L93 Difference]: Finished difference Result 321 states and 364 transitions. [2019-12-07 12:59:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:59:41,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-12-07 12:59:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:41,939 INFO L225 Difference]: With dead ends: 321 [2019-12-07 12:59:41,939 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 12:59:41,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:59:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 12:59:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2019-12-07 12:59:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 12:59:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2019-12-07 12:59:41,955 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 91 [2019-12-07 12:59:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:41,955 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2019-12-07 12:59:41,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:59:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2019-12-07 12:59:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:59:41,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:41,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:41,956 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash 116218975, now seen corresponding path program 1 times [2019-12-07 12:59:41,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:41,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651052044] [2019-12-07 12:59:41,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:42,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651052044] [2019-12-07 12:59:42,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:42,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:59:42,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105736075] [2019-12-07 12:59:42,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:59:42,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:59:42,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:59:42,024 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand 12 states. [2019-12-07 12:59:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:42,194 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2019-12-07 12:59:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:59:42,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-12-07 12:59:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:42,194 INFO L225 Difference]: With dead ends: 166 [2019-12-07 12:59:42,194 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:59:42,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:59:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:59:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:59:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:59:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:59:42,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-12-07 12:59:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:42,196 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:59:42,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:59:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:59:42,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:59:42,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:59:42,646 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-12-07 12:59:42,839 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 198 [2019-12-07 12:59:43,185 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 191 [2019-12-07 12:59:43,382 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 190 [2019-12-07 12:59:43,564 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 180 [2019-12-07 12:59:44,430 WARN L192 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 469 DAG size of output: 442 [2019-12-07 12:59:45,156 WARN L192 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 472 DAG size of output: 403 [2019-12-07 12:59:45,904 WARN L192 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 470 DAG size of output: 446 [2019-12-07 12:59:46,060 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-12-07 12:59:47,580 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 485 DAG size of output: 451 [2019-12-07 12:59:47,918 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 268 [2019-12-07 12:59:48,522 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-12-07 12:59:48,660 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-12-07 12:59:48,979 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 176 [2019-12-07 12:59:49,263 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 275 [2019-12-07 12:59:49,417 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-12-07 12:59:49,555 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-12-07 12:59:49,766 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 185 [2019-12-07 12:59:50,136 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 208 [2019-12-07 12:59:50,533 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-12-07 12:59:50,870 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-12-07 12:59:51,432 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-12-07 12:59:51,754 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 12:59:51,864 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-12-07 12:59:52,694 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 68 [2019-12-07 12:59:53,507 WARN L192 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-12-07 12:59:53,657 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-12-07 12:59:54,605 WARN L192 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 69 [2019-12-07 12:59:54,763 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-07 12:59:54,906 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-12-07 12:59:55,108 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-07 12:59:55,319 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-12-07 12:59:55,494 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-12-07 12:59:55,656 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-07 12:59:55,905 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-12-07 12:59:56,550 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-12-07 12:59:57,462 WARN L192 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 92 [2019-12-07 12:59:57,710 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-07 12:59:58,707 WARN L192 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-12-07 12:59:59,700 WARN L192 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 66 [2019-12-07 12:59:59,915 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-12-07 13:00:00,503 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-12-07 13:00:00,682 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-12-07 13:00:03,390 WARN L192 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 438 DAG size of output: 148 [2019-12-07 13:00:03,572 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-07 13:00:03,703 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-07 13:00:06,702 WARN L192 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 393 DAG size of output: 146 [2019-12-07 13:00:10,166 WARN L192 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 440 DAG size of output: 146 [2019-12-07 13:00:10,984 WARN L192 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-12-07 13:00:11,154 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-07 13:00:11,341 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-07 13:00:16,876 WARN L192 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 450 DAG size of output: 148 [2019-12-07 13:00:17,140 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-12-07 13:00:18,730 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 257 DAG size of output: 102 [2019-12-07 13:00:19,154 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:00:19,592 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 74 [2019-12-07 13:00:19,803 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-12-07 13:00:20,120 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 13:00:20,306 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-12-07 13:00:20,479 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 13:00:20,646 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 13:00:20,801 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 13:00:20,970 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 13:00:21,272 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-12-07 13:00:21,442 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-12-07 13:00:21,968 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-12-07 13:00:22,796 WARN L192 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 91 [2019-12-07 13:00:23,113 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-07 13:00:23,266 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-12-07 13:00:23,846 WARN L192 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-12-07 13:00:24,167 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-12-07 13:00:24,388 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-07 13:00:24,585 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-07 13:00:26,238 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 180 DAG size of output: 69 [2019-12-07 13:00:27,610 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 160 DAG size of output: 61 [2019-12-07 13:00:28,139 WARN L192 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-12-07 13:00:28,715 WARN L192 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-12-07 13:00:29,165 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-07 13:00:29,903 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 81 [2019-12-07 13:00:31,682 WARN L192 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 265 DAG size of output: 100 [2019-12-07 13:00:32,499 WARN L192 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 69 [2019-12-07 13:00:33,400 WARN L192 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 61 [2019-12-07 13:00:33,920 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2019-12-07 13:00:34,134 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-12-07 13:00:34,748 WARN L192 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 77 [2019-12-07 13:00:35,493 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-12-07 13:00:36,035 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-12-07 13:00:36,352 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-12-07 13:00:37,709 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2019-12-07 13:00:37,859 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-12-07 13:00:38,786 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 82 [2019-12-07 13:00:39,199 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-12-07 13:00:39,514 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-07 13:00:39,715 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 13:00:39,980 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-07 13:00:40,414 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 13:00:40,661 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-12-07 13:00:40,940 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-12-07 13:00:41,512 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-12-07 13:00:41,795 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-12-07 13:00:42,678 WARN L192 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-12-07 13:00:42,827 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-12-07 13:00:42,838 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1426) no Hoare annotation was computed. [2019-12-07 13:00:42,838 INFO L246 CegarLoopResult]: For program point L234-1(lines 227 415) no Hoare annotation was computed. [2019-12-07 13:00:42,838 INFO L242 CegarLoopResult]: At program point L895(lines 894 904) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,838 INFO L246 CegarLoopResult]: For program point L1295(lines 1295 1309) no Hoare annotation was computed. [2019-12-07 13:00:42,838 INFO L246 CegarLoopResult]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-12-07 13:00:42,838 INFO L246 CegarLoopResult]: For program point L635(lines 635 640) no Hoare annotation was computed. [2019-12-07 13:00:42,838 INFO L246 CegarLoopResult]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2019-12-07 13:00:42,839 INFO L242 CegarLoopResult]: At program point L1560(lines 1181 1562) the Hoare annotation is: (let ((.cse12 (= 1 ~pended~0)) (.cse15 (+ ~s~0 5)) (.cse7 (= ~IPC~0 ~s~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse17 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse14 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse13 (= ~s~0 ~DC~0)) (.cse0 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= 0 ~compRegistered~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse19 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse11 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse8 .cse4 .cse6 .cse13) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse14 .cse2 .cse8 .cse4 .cse9 (<= .cse15 ~IPC~0) .cse6 .cse13 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse12 (= ~s~0 ~NP~0) .cse4 .cse6 (<= .cse15 ~MPR3~0)) (and .cse1 .cse2 .cse8 .cse4 .cse9 .cse6 .cse16 .cse17 .cse18 .cse11 .cse7) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse2 .cse4 .cse6 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~DC~0 7) ~s~0) .cse10 .cse11) (and .cse1 .cse2 .cse8 .cse4 .cse9 .cse19 .cse6 .cse16 .cse17 .cse18 .cse11) (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse1 .cse14 .cse2 .cse8 .cse4 .cse9 .cse6 .cse13 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse9 .cse19 .cse5 .cse6 .cse10 .cse11))) [2019-12-07 13:00:42,839 INFO L246 CegarLoopResult]: For program point L1296(lines 1296 1302) no Hoare annotation was computed. [2019-12-07 13:00:42,839 INFO L246 CegarLoopResult]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-12-07 13:00:42,839 INFO L246 CegarLoopResult]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-12-07 13:00:42,839 INFO L242 CegarLoopResult]: At program point L1034(lines 964 1036) the Hoare annotation is: (let ((.cse9 (= ~IPC~0 ~s~0)) (.cse11 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse12 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse10 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse12 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse13 .cse5 .cse11 .cse12 .cse8) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 13:00:42,839 INFO L242 CegarLoopResult]: At program point L1034-1(lines 964 1036) the Hoare annotation is: (let ((.cse9 (= ~IPC~0 ~s~0)) (.cse11 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse12 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse10 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse12 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse13 .cse5 .cse11 .cse12 .cse8) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 13:00:42,839 INFO L242 CegarLoopResult]: At program point L1034-2(lines 964 1036) the Hoare annotation is: (let ((.cse26 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse27 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse9 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse21 (= ~myStatus~0 0)) (.cse23 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse24 (= ~MPR3~0 ~s~0)) (.cse25 (= 259 |ULTIMATE.start_IofCallDriver_#res|)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse27 0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse22 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse8 (<= (+ .cse26 1) 0)) (.cse10 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse11 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse27)) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse17 (<= (+ ~myStatus~0 1073741637) 0)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse26) 3221225494))) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse20 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (= ~myStatus~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse3 .cse4 .cse7 .cse5 .cse8 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse24 .cse16 .cse15 .cse25 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5 .cse8 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse24 .cse16 .cse15 .cse17 .cse25 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2019-12-07 13:00:42,840 INFO L242 CegarLoopResult]: At program point L1034-3(lines 964 1036) the Hoare annotation is: (let ((.cse24 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse25 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse13 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse20 (= ~s~0 ~NP~0)) (.cse21 (<= (+ ~s~0 5) ~MPR3~0)) (.cse22 (not .cse13)) (.cse23 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= .cse25 0)) (.cse6 (<= (+ .cse24 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse12 (<= 0 .cse25)) (.cse14 (= ~MPR3~0 ~s~0)) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse24) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (= 259 |ULTIMATE.start_IofCallDriver_#res|)) (.cse19 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse20 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse22 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse23 .cse16 .cse17 .cse19) (and .cse1 .cse0 .cse20 .cse2 .cse3 .cse21 .cse4 .cse5 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse6 .cse22 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse23 .cse16 .cse17 .cse19) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2019-12-07 13:00:42,840 INFO L242 CegarLoopResult]: At program point L1034-4(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 .cse8 (= ~IPC~0 ~s~0)))) [2019-12-07 13:00:42,840 INFO L242 CegarLoopResult]: At program point L1034-5(lines 964 1036) the Hoare annotation is: (let ((.cse5 (= ~SKIP2~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= 1 ~pended~0)) (.cse9 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse10 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13) (and .cse0 (= ~s~0 ~NP~0) .cse3 .cse6 (<= (+ ~s~0 5) ~MPR3~0)) (and .cse9 .cse2 .cse3 .cse10 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse6 .cse11 .cse7 .cse8 .cse12 .cse13))) [2019-12-07 13:00:42,840 INFO L242 CegarLoopResult]: At program point L1034-6(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 .cse8 (= ~IPC~0 ~s~0) .cse9))) [2019-12-07 13:00:42,840 INFO L242 CegarLoopResult]: At program point L1034-7(lines 964 1036) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse1 (= 0 ~pended~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (<= .cse18 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse11 (<= 0 .cse18)) (.cse12 (= 1 ~compRegistered~0)) (.cse13 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse15 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 (= ~s~0 ~NP~0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse7 .cse8 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~myStatus~0 0) .cse1 .cse0 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse8 .cse9 .cse10 .cse11 (= ~MPR3~0 ~s~0) .cse12 .cse13 (= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse14 .cse15 .cse16)))) [2019-12-07 13:00:42,840 INFO L242 CegarLoopResult]: At program point L1034-8(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 .cse8 (= ~IPC~0 ~s~0) .cse9))) [2019-12-07 13:00:42,841 INFO L242 CegarLoopResult]: At program point L1034-9(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 .cse8 (= ~IPC~0 ~s~0) .cse9))) [2019-12-07 13:00:42,841 INFO L242 CegarLoopResult]: At program point L1034-10(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 .cse8 (= ~IPC~0 ~s~0) .cse9))) [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1436) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L242 CegarLoopResult]: At program point L642(lines 610 644) the Hoare annotation is: (let ((.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse22 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse19 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse20 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse22 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~s~0 5) ~MPR3~0)) (.cse8 (<= (+ .cse21 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse11 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse22)) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse18 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) .cse8 .cse9 (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ ~myStatus~0 1073741637) 0) .cse17 .cse18) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse20 .cse9 (not (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point L510(lines 510 515) no Hoare annotation was computed. [2019-12-07 13:00:42,841 INFO L246 CegarLoopResult]: For program point L510-2(lines 510 515) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L242 CegarLoopResult]: At program point L907(lines 907 928) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L116(lines 116 146) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L116-2(lines 108 156) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L116-3(lines 116 146) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-2(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L116-5(lines 108 156) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-4(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-6(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-8(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-10(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-12(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-14(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1041-16(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L779(lines 779 783) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L1572(lines 1572 1576) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L119-2(lines 119 121) no Hoare annotation was computed. [2019-12-07 13:00:42,842 INFO L246 CegarLoopResult]: For program point L119-3(lines 119 121) no Hoare annotation was computed. [2019-12-07 13:00:42,843 INFO L246 CegarLoopResult]: For program point L119-5(lines 119 121) no Hoare annotation was computed. [2019-12-07 13:00:42,843 INFO L242 CegarLoopResult]: At program point L1177(lines 1166 1179) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0) (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) [2019-12-07 13:00:42,843 INFO L242 CegarLoopResult]: At program point L1177-1(lines 1166 1179) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0) (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) [2019-12-07 13:00:42,843 INFO L246 CegarLoopResult]: For program point L914(lines 914 926) no Hoare annotation was computed. [2019-12-07 13:00:42,843 INFO L242 CegarLoopResult]: At program point L1575(lines 1563 1579) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,843 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,843 INFO L242 CegarLoopResult]: At program point L915(lines 914 926) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,843 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,843 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,843 INFO L242 CegarLoopResult]: At program point L917(lines 916 926) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,844 INFO L242 CegarLoopResult]: At program point L785(lines 778 833) the Hoare annotation is: (let ((.cse33 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse34 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse19 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse23 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse29 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse30 (= 1 ~pended~0)) (.cse3 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse14 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (<= .cse34 0)) (.cse17 (<= (+ .cse33 1) 0)) (.cse18 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse20 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse22 (<= 0 .cse34)) (.cse24 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse33) 3221225494))) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse25 (= ULTIMATE.start_main_~status~1 0)) (.cse26 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse27 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse28 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~IPC~0 ~s~0)) (.cse32 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse10 (<= (+ ~DC~0 7) ~s~0)) (.cse11 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse31 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse2 (= 0 ~pended~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse21 (not (= ULTIMATE.start_main_~status~1 259))) (.cse16 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse9 .cse13 .cse6 .cse11 .cse12) (and .cse2 .cse5 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 .cse8 .cse19 .cse9 .cse20 .cse21 .cse22 .cse11 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse23 .cse24 .cse12) (and .cse2 .cse5 .cse14 .cse15 .cse16 .cse6 .cse17 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse18 .cse8 .cse19 .cse9 .cse20 .cse22 .cse21 .cse11 .cse23 .cse24 .cse12) (and .cse1 .cse2 .cse8 .cse4 .cse9 .cse25 .cse26 .cse27 .cse28 .cse12 .cse7) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse2 .cse8 .cse29 .cse16) (and .cse30 .cse1 .cse8 .cse4 .cse9 .cse7) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse2 .cse29 .cse16) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse31 .cse2 .cse8 .cse9 .cse21 .cse14 .cse16 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse0 .cse32 .cse1 .cse2 .cse8 .cse4 .cse5 .cse9 .cse13 .cse6 .cse11 .cse12) (and .cse30 .cse1 .cse8 .cse4 .cse9 .cse13 .cse11 .cse12) (and .cse30 .cse8 .cse4 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse2 .cse16 .cse25 (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) (and (= ~myStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse2 .cse5 .cse14 .cse15 .cse16 .cse6 .cse25 .cse17 .cse18 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse8 .cse9 .cse20 .cse22 .cse11 .cse24 .cse12) (and .cse1 .cse2 .cse8 .cse4 .cse9 .cse13 .cse25 .cse26 .cse27 .cse28 .cse12) (and .cse0 .cse1 .cse2 .cse5 .cse4 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse1 .cse31 .cse2 .cse8 .cse9 .cse21 .cse16 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259)))))) [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L389(lines 389 394) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L389-2(lines 227 415) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L1314(lines 1314 1548) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L242 CegarLoopResult]: At program point L1315(lines 1314 1548) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L258(lines 258 289) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L127(lines 127 134) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L127-1(lines 127 134) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L1450(lines 1450 1453) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L526(lines 526 591) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L526-1(lines 526 591) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L1319(lines 1319 1546) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-12-07 13:00:42,844 INFO L246 CegarLoopResult]: For program point L130-2(lines 130 132) no Hoare annotation was computed. [2019-12-07 13:00:42,845 INFO L246 CegarLoopResult]: For program point L130-3(lines 130 132) no Hoare annotation was computed. [2019-12-07 13:00:42,845 INFO L246 CegarLoopResult]: For program point L130-5(lines 130 132) no Hoare annotation was computed. [2019-12-07 13:00:42,845 INFO L246 CegarLoopResult]: For program point L395-1(lines 395 399) no Hoare annotation was computed. [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1320(lines 1319 1546) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 13:00:42,845 INFO L246 CegarLoopResult]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-12-07 13:00:42,845 INFO L246 CegarLoopResult]: For program point L263-2(lines 263 265) no Hoare annotation was computed. [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,845 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056-1(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056-2(lines 1051 1058) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (= 1 ~compRegistered~0)) (.cse11 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~myStatus~0 1073741637) 0) .cse11) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056-3(lines 1051 1058) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (= 1 ~compRegistered~0)) (.cse11 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~myStatus~0 1073741637) 0) .cse11) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056-4(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056-5(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056-6(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,845 INFO L242 CegarLoopResult]: At program point L1056-7(lines 1051 1058) the Hoare annotation is: (and (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0) (= ~setEventCalled~0 1)) [2019-12-07 13:00:42,845 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,846 INFO L242 CegarLoopResult]: At program point L1056-8(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,846 INFO L242 CegarLoopResult]: At program point L1056-9(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,846 INFO L242 CegarLoopResult]: At program point L1056-10(lines 1051 1058) the Hoare annotation is: false [2019-12-07 13:00:42,846 INFO L246 CegarLoopResult]: For program point L528(lines 528 568) no Hoare annotation was computed. [2019-12-07 13:00:42,846 INFO L242 CegarLoopResult]: At program point L793(lines 786 832) the Hoare annotation is: (let ((.cse34 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse35 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse6 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse16 (= 1 ~pended~0)) (.cse27 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse31 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse21 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse12 (= ~SKIP2~0 ~s~0)) (.cse1 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse4 (not (= ULTIMATE.start_main_~status~1 259))) (.cse22 (<= (+ ~DC~0 7) ~s~0)) (.cse17 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse18 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse19 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse9 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse10 (= 0 ~compRegistered~0)) (.cse20 (= ~IPC~0 ~s~0)) (.cse11 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse23 (<= (+ ~s~0 5) ~IPC~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse24 (<= .cse35 0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse25 (<= (+ .cse34 1) 0)) (.cse26 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse28 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse29 (<= 0 .cse35)) (.cse30 (<= 259 |ULTIMATE.start_IofCallDriver_#res|)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse32 (<= |ULTIMATE.start_IofCallDriver_#res| 259)) (.cse33 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse34) 3221225494))) (.cse15 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse6 .cse5) (and .cse7 .cse5 (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) (and .cse8 .cse0 .cse2 .cse9 .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse2 .cse6 .cse5) (and (or (and .cse16 .cse0 .cse2 .cse10 .cse3 .cse14 .cse15) (and .cse0 .cse2 .cse10 .cse3 .cse7 .cse17 .cse18 .cse19 .cse15)) .cse12) (and .cse16 .cse2 .cse5) (and .cse16 .cse0 .cse2 .cse10 .cse3 .cse20) (and .cse8 .cse21 .cse0 .cse2 .cse11 .cse10 .cse3 .cse22 .cse13 .cse14 .cse15 .cse20) (and .cse11 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse23 .cse13 .cse5 .cse24 .cse25 .cse26 .cse2 .cse27 .cse3 .cse28 .cse4 .cse29 .cse30 .cse14 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse31 .cse32 .cse33 .cse15) (and .cse11 .cse23 .cse13 .cse5 .cse24 .cse25 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse26 .cse2 .cse27 .cse3 .cse28 .cse4 .cse29 .cse14 .cse31 .cse33 .cse15) (and .cse8 .cse21 .cse0 .cse2 .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse2 .cse1 .cse3 .cse23 .cse4 .cse5 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse8 .cse9 .cse0 .cse2 .cse11 .cse10 .cse3 .cse22 .cse13 .cse14 .cse15 .cse20) (and .cse0 .cse2 .cse10 .cse3 .cse7 .cse17 .cse18 .cse19 .cse15 .cse20) (and .cse8 .cse9 .cse0 .cse2 .cse11 .cse10 .cse3 .cse13 .cse14 .cse15 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse20) (and (= ~myStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse11 .cse23 .cse13 .cse5 .cse24 .cse7 .cse25 .cse26 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse2 .cse3 .cse28 .cse29 .cse30 .cse14 .cse32 .cse33 .cse15)))) [2019-12-07 13:00:42,846 INFO L246 CegarLoopResult]: For program point L529(lines 529 539) no Hoare annotation was computed. [2019-12-07 13:00:42,846 INFO L249 CegarLoopResult]: At program point L794(lines 778 833) the Hoare annotation is: true [2019-12-07 13:00:42,846 INFO L242 CegarLoopResult]: At program point L662(lines 722 724) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ~myStatus~0 1073741637) 0) .cse9))) [2019-12-07 13:00:42,847 INFO L242 CegarLoopResult]: At program point L1059(lines 1059 1100) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= .cse21 0)) (.cse7 (<= (+ .cse20 1) 0)) (.cse8 (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse21)) (.cse15 (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0)) (.cse16 (= 1 ~compRegistered~0)) (.cse17 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ ~myStatus~0 1073741637) 0) .cse18 .cse19)))) [2019-12-07 13:00:42,847 INFO L242 CegarLoopResult]: At program point L1059-1(lines 1059 1100) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse20 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~s~0 5) ~MPR3~0)) (.cse8 (<= (+ .cse19 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse20)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,847 INFO L242 CegarLoopResult]: At program point L1059-2(lines 1059 1100) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 .cse4 .cse6 .cse5 (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-12-07 13:00:42,847 INFO L242 CegarLoopResult]: At program point L1059-3(lines 1059 1100) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,847 INFO L246 CegarLoopResult]: For program point L795(lines 795 830) no Hoare annotation was computed. [2019-12-07 13:00:42,847 INFO L246 CegarLoopResult]: For program point L796(lines 796 829) no Hoare annotation was computed. [2019-12-07 13:00:42,847 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1591) no Hoare annotation was computed. [2019-12-07 13:00:42,847 INFO L246 CegarLoopResult]: For program point L1589-2(lines 1587 1618) no Hoare annotation was computed. [2019-12-07 13:00:42,847 INFO L242 CegarLoopResult]: At program point L929(lines 929 949) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,847 INFO L242 CegarLoopResult]: At program point L929-1(lines 929 949) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 (= ~SKIP2~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse8 .cse10))) [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L797(lines 797 807) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L533(lines 533 536) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L269(lines 269 275) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L798(lines 798 804) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1592-1(lines 1592 1616) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1480) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1328(lines 1328 1544) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1064(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1064-1(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1064-2(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1064-3(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1464) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1065(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1065-2(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1065-4(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L1065-6(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 13:00:42,848 INFO L246 CegarLoopResult]: For program point L142(lines 142 144) no Hoare annotation was computed. [2019-12-07 13:00:42,849 INFO L246 CegarLoopResult]: For program point L142-1(lines 142 144) no Hoare annotation was computed. [2019-12-07 13:00:42,849 INFO L246 CegarLoopResult]: For program point L935(lines 935 947) no Hoare annotation was computed. [2019-12-07 13:00:42,849 INFO L246 CegarLoopResult]: For program point L935-1(lines 935 947) no Hoare annotation was computed. [2019-12-07 13:00:42,849 INFO L242 CegarLoopResult]: At program point L936(lines 935 947) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,849 INFO L242 CegarLoopResult]: At program point L936-1(lines 935 947) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 (= ~SKIP2~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse8 .cse10))) [2019-12-07 13:00:42,849 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,849 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,849 INFO L242 CegarLoopResult]: At program point L541(lines 528 568) the Hoare annotation is: (let ((.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse22 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~s~0 5) ~MPR3~0)) (.cse6 (<= .cse22 0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse21 1) 0)) (.cse9 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse10 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse11 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse12 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse13 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse22)) (.cse17 (= 1 ~compRegistered~0)) (.cse18 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse20 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse10 .cse11 (not (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2019-12-07 13:00:42,849 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1479) no Hoare annotation was computed. [2019-12-07 13:00:42,849 INFO L242 CegarLoopResult]: At program point L938(lines 937 947) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,849 INFO L242 CegarLoopResult]: At program point L938-1(lines 937 947) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 (= ~SKIP2~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse8 .cse10))) [2019-12-07 13:00:42,850 INFO L246 CegarLoopResult]: For program point L542-1(lines 542 545) no Hoare annotation was computed. [2019-12-07 13:00:42,850 INFO L246 CegarLoopResult]: For program point L1600(lines 1600 1602) no Hoare annotation was computed. [2019-12-07 13:00:42,850 INFO L246 CegarLoopResult]: For program point L1600-2(lines 1600 1602) no Hoare annotation was computed. [2019-12-07 13:00:42,850 INFO L242 CegarLoopResult]: At program point L1072(lines 1064 1083) the Hoare annotation is: (let ((.cse25 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse24 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (not (= 259 |ULTIMATE.start_IofCallDriver_#res|))) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= .cse24 0)) (.cse4 (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (.cse5 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741823) 0)) (.cse6 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse7 (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0)) (.cse8 (= 1 ~compRegistered~0)) (.cse9 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse25) 3221225494))) (.cse10 (= ~s~0 ~NP~0)) (.cse11 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse12 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (<= (+ ~s~0 5) ~MPR3~0)) (.cse15 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse16 (<= (+ .cse25 1) 0)) (.cse17 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse18 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (<= 0 .cse24)) (.cse21 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse22 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse23 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ~myStatus~0 1073741637) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2019-12-07 13:00:42,850 INFO L242 CegarLoopResult]: At program point L1072-1(lines 1064 1083) the Hoare annotation is: false [2019-12-07 13:00:42,850 INFO L242 CegarLoopResult]: At program point L1072-2(lines 1064 1083) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= 0 ~pended~0) .cse1 .cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 .cse5 .cse6 .cse4 (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-12-07 13:00:42,850 INFO L242 CegarLoopResult]: At program point L1072-3(lines 1064 1083) the Hoare annotation is: false [2019-12-07 13:00:42,850 INFO L246 CegarLoopResult]: For program point L1337(lines 1337 1542) no Hoare annotation was computed. [2019-12-07 13:00:42,850 INFO L242 CegarLoopResult]: At program point L809(lines 796 829) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2))) (let ((.cse2 (= ~s~0 ~DC~0)) (.cse15 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse10 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (= 0 ~compRegistered~0)) (.cse1 (<= .cse23 ~SKIP2~0)) (.cse16 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse8 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse11 (= 1 ~pended~0)) (.cse12 (<= .cse23 ~s~0)) (.cse3 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse9 (= ULTIMATE.start_main_~status~1 0)) (.cse20 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse21 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse22 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse4 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse5 (not (= ULTIMATE.start_main_~status~1 259))) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse7 (or (and .cse10 .cse0 .cse1 .cse2) (and .cse15 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse10 .cse0 .cse13 .cse1 .cse16 .cse17))) (.cse14 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| ~s~0 1073741816) ~IPC~0) .cse2 (<= (+ ~s~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 1073741816) ~IPC~0) (<= (+ ULTIMATE.start_main_~status~1 1073741816) 0)) (and .cse3 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 ~DC~0 1073741825) ~s~0) .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741825) ~s~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse8 .cse2) (and .cse9 .cse2 (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse3 .cse10 .cse0 .cse1 .cse5 .cse2 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse0 (<= (+ ULTIMATE.start_main_~status~1 1073741813) 0) .cse2 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| ~s~0 1073741813) ~SKIP2~0) (<= (+ ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ~DC~0 1073741813) ~SKIP2~0)) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse0 .cse8 .cse2) (and .cse11 .cse0 .cse2) (and .cse12 .cse4 .cse6 .cse7) (and .cse11 .cse0 .cse13) (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse4 .cse6 .cse9 .cse7 .cse14) (and .cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse12 .cse10 .cse0 .cse13 .cse4 .cse1 .cse6 .cse16 .cse17) (and (not (= 259 |ULTIMATE.start_IofCallDriver_#res|)) .cse18 .cse4 .cse5 .cse6 .cse19 .cse7 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse14) (and (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse6 (<= (+ ULTIMATE.start_main_~status~1 1073741823) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) .cse7) (and .cse10 .cse0 .cse13 .cse1 .cse9 .cse20 .cse21 .cse22 .cse17) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse3 .cse5 .cse7 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse20 .cse21 .cse22) (and .cse18 .cse4 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse5 .cse6 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse19 .cse7 .cse14))))) [2019-12-07 13:00:42,851 INFO L246 CegarLoopResult]: For program point L1470(lines 1470 1478) no Hoare annotation was computed. [2019-12-07 13:00:42,851 INFO L242 CegarLoopResult]: At program point L1338(lines 1328 1544) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,851 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,851 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,851 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,851 INFO L246 CegarLoopResult]: For program point L811(lines 811 813) no Hoare annotation was computed. [2019-12-07 13:00:42,851 INFO L242 CegarLoopResult]: At program point L548-2(lines 548 564) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~s~0 5) ~MPR3~0)) (.cse6 (<= .cse20 0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse19 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse20)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse18 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse9 .cse10 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_IoQueryDeviceDescription_#res| 259)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,851 INFO L242 CegarLoopResult]: At program point L416(lines 227 417) the Hoare annotation is: (let ((.cse24 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse25 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse23 (+ ~s~0 5))) (let ((.cse19 (= ~SKIP2~0 ~s~0)) (.cse17 (<= (+ ~DC~0 5) ~IPC~0)) (.cse21 (= 1 ~pended~0)) (.cse2 (<= .cse23 ~IPC~0)) (.cse3 (<= .cse25 0)) (.cse5 (= ~s~0 ~DC~0)) (.cse7 (<= (+ .cse24 1) 0)) (.cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse25)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse24) 3221225494))) (.cse0 (= 0 ~pended~0)) (.cse18 (= 0 ~compRegistered~0)) (.cse1 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse22 (= ~IPC~0 ~s~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse20 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse16 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse18 .cse1 .cse19 .cse6 .cse4 .cse8 .cse9 .cse11 .cse14 .cse20 .cse16) (and .cse21 .cse17 .cse9 .cse18 .cse11 .cse19 .cse6 .cse14 .cse16) (and .cse21 .cse9 .cse18 .cse6 .cse5) (and .cse21 .cse17 .cse9 .cse18 .cse11 .cse6 .cse22) (and .cse21 (= ~s~0 ~NP~0) .cse18 .cse6 (<= .cse23 ~MPR3~0)) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse9 .cse0 .cse1 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse1 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse15 .cse16) (and .cse0 .cse18 .cse1 .cse6 .cse4 .cse8 .cse22 .cse9 .cse11 (<= (+ ~DC~0 7) ~s~0) .cse14 .cse20 .cse16)))) [2019-12-07 13:00:42,851 INFO L246 CegarLoopResult]: For program point L1077(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L242 CegarLoopResult]: At program point L1077-1(lines 1077 1081) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= .cse21 0)) (.cse7 (<= (+ .cse20 1) 0)) (.cse8 (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse21)) (.cse15 (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0)) (.cse16 (= 1 ~compRegistered~0)) (.cse17 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ ~myStatus~0 1073741637) 0) .cse18 .cse19)))) [2019-12-07 13:00:42,852 INFO L246 CegarLoopResult]: For program point L1077-2(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L242 CegarLoopResult]: At program point L1077-3(lines 1077 1081) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse20 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~s~0 5) ~MPR3~0)) (.cse8 (<= (+ .cse19 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse20)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,852 INFO L246 CegarLoopResult]: For program point L1077-4(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L242 CegarLoopResult]: At program point L1077-5(lines 1077 1081) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 .cse4 .cse6 .cse5 (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-12-07 13:00:42,852 INFO L246 CegarLoopResult]: For program point L1077-6(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L242 CegarLoopResult]: At program point L1077-7(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,852 INFO L246 CegarLoopResult]: For program point L549(lines 548 564) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L246 CegarLoopResult]: For program point L1474(lines 1474 1477) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L246 CegarLoopResult]: For program point L815(lines 815 827) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L246 CegarLoopResult]: For program point L1608(lines 1608 1614) no Hoare annotation was computed. [2019-12-07 13:00:42,852 INFO L242 CegarLoopResult]: At program point L155(lines 95 157) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (<= (+ ~s~0 5) ~MPR3~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) .cse2 .cse3 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1073741101) 0)) (and (= 1 ~pended~0) .cse0 .cse1 .cse3 .cse2))) [2019-12-07 13:00:42,853 INFO L242 CegarLoopResult]: At program point L155-1(lines 95 157) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= ~s~0 ~NP~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= 0 ~pended~0) .cse1 .cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse3 .cse6 .cse5 .cse4 (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L816(lines 816 820) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L1346(lines 1346 1540) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L242 CegarLoopResult]: At program point L1482(lines 1346 1540) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L293-1(lines 227 415) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1098) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L1086-1(lines 1086 1098) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L1086-2(lines 1086 1098) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L1086-3(lines 1086 1098) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L954(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L954-2(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L954-4(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L822(lines 822 826) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L954-6(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,853 INFO L246 CegarLoopResult]: For program point L954-8(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L954-10(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L954-12(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L954-14(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L954-16(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L954-18(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L426-2(lines 426 428) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L246 CegarLoopResult]: For program point L954-20(lines 954 960) no Hoare annotation was computed. [2019-12-07 13:00:42,854 INFO L242 CegarLoopResult]: At program point L1087(lines 1086 1098) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= .cse21 0)) (.cse7 (<= (+ .cse20 1) 0)) (.cse8 (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse21)) (.cse15 (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0)) (.cse16 (= 1 ~compRegistered~0)) (.cse17 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ ~myStatus~0 1073741637) 0) .cse18 .cse19)))) [2019-12-07 13:00:42,854 INFO L242 CegarLoopResult]: At program point L1087-1(lines 1086 1098) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse20 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~s~0 5) ~MPR3~0)) (.cse8 (<= (+ .cse19 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse20)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,854 INFO L242 CegarLoopResult]: At program point L1087-2(lines 1086 1098) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 .cse4 .cse6 .cse5 (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-12-07 13:00:42,854 INFO L242 CegarLoopResult]: At program point L1087-3(lines 1086 1098) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,855 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,855 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,855 INFO L242 CegarLoopResult]: At program point L1617(lines 1580 1619) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse2 (+ ~s~0 5)) (.cse1 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) (= ~s~0 ~NP~0) .cse0 .cse1 (<= .cse2 ~MPR3~0)) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse0 (<= (+ ~DC~0 2) ~SKIP2~0) (<= .cse2 ~IPC~0) .cse1 (= ~s~0 ~DC~0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)))) [2019-12-07 13:00:42,855 INFO L246 CegarLoopResult]: For program point L560(lines 560 562) no Hoare annotation was computed. [2019-12-07 13:00:42,855 INFO L242 CegarLoopResult]: At program point L1089(lines 1088 1098) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= .cse21 0)) (.cse7 (<= (+ .cse20 1) 0)) (.cse8 (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse21)) (.cse15 (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0)) (.cse16 (= 1 ~compRegistered~0)) (.cse17 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ ~myStatus~0 1073741637) 0) .cse18 .cse19)))) [2019-12-07 13:00:42,855 INFO L242 CegarLoopResult]: At program point L1089-1(lines 1088 1098) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse20 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~s~0 5) ~MPR3~0)) (.cse8 (<= (+ .cse19 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse20)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,855 INFO L242 CegarLoopResult]: At program point L1089-2(lines 1088 1098) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 .cse4 .cse6 .cse5 (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-12-07 13:00:42,855 INFO L242 CegarLoopResult]: At program point L1089-3(lines 1088 1098) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,856 INFO L242 CegarLoopResult]: At program point L429(lines 158 431) the Hoare annotation is: (let ((.cse25 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse26 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse23 (+ ~s~0 5))) (let ((.cse4 (= 1 ~pended~0)) (.cse17 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse20 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse12 (<= .cse23 ~IPC~0)) (.cse13 (<= .cse26 0)) (.cse2 (= ~s~0 ~DC~0)) (.cse15 (<= (+ .cse25 1) 0)) (.cse16 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse18 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse19 (<= 0 .cse26)) (.cse21 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse25) 3221225494))) (.cse22 (= ~IPC~0 ~s~0)) (.cse24 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (= 0 ~compRegistered~0)) (.cse11 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse3 .cse9 .cse10) (and .cse1 .cse11 .cse12 .cse13 .cse14 .cse2 .cse3 .cse15 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse16 .cse0 .cse17 .cse7 .cse18 .cse19 .cse9 .cse20 .cse21 .cse10) (and .cse4 .cse0 .cse6 .cse3 .cse2) (and .cse4 .cse5 .cse0 .cse6 .cse7 .cse3 .cse22) (and .cse4 (= ~s~0 ~NP~0) .cse6 .cse3 (<= .cse23 ~MPR3~0)) (and .cse1 .cse11 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse12 .cse13 .cse14 .cse2 .cse3 .cse15 .cse16 .cse0 .cse17 .cse7 .cse18 .cse19 .cse9 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse20 .cse21 .cse10) (and (= ~myStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse1 .cse11 .cse12 .cse13 .cse14 .cse2 .cse3 .cse15 .cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse0 .cse7 .cse18 .cse19 .cse9 .cse21 .cse10) (and .cse24 .cse1 .cse0 .cse6 .cse11 .cse7 (<= (+ ~DC~0 7) ~s~0) .cse3 .cse14 .cse9 .cse10 .cse22) (and .cse24 .cse5 .cse1 .cse0 .cse6 .cse11 .cse7 .cse8 .cse3 .cse14 .cse9 .cse10)))) [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1355(lines 1355 1538) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L299(lines 299 305) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L242 CegarLoopResult]: At program point L565(lines 526 591) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1536) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625-2(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625-3(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625-4(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1493(lines 1493 1496) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625-5(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625-6(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,856 INFO L246 CegarLoopResult]: For program point L1625-7(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-8(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-9(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-10(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-11(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-12(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-13(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-14(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-15(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-16(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-17(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-18(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-19(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-20(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-21(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-22(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-23(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-24(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-25(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-26(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-27(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-28(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,857 INFO L246 CegarLoopResult]: For program point L1625-29(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,858 INFO L246 CegarLoopResult]: For program point L1625-30(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,858 INFO L242 CegarLoopResult]: At program point L1626(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 13:00:42,858 INFO L246 CegarLoopResult]: For program point L1625-31(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,858 INFO L242 CegarLoopResult]: At program point L1626-1(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 13:00:42,858 INFO L246 CegarLoopResult]: For program point L1625-32(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,858 INFO L242 CegarLoopResult]: At program point L1626-2(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~s~0 5) ~IPC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 13:00:42,858 INFO L246 CegarLoopResult]: For program point L1625-33(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,858 INFO L242 CegarLoopResult]: At program point L1626-3(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 13:00:42,858 INFO L246 CegarLoopResult]: For program point L1625-34(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,858 INFO L242 CegarLoopResult]: At program point L1626-4(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 13:00:42,858 INFO L246 CegarLoopResult]: For program point L1625-35(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,858 INFO L242 CegarLoopResult]: At program point L1626-5(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,858 INFO L246 CegarLoopResult]: For program point L1625-36(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-37(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L242 CegarLoopResult]: At program point L1626-7(lines 1 1628) the Hoare annotation is: (let ((.cse6 (= ~SKIP2~0 ~s~0)) (.cse10 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse11 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse10 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~DC~0 7) ~s~0) .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 ~DC~0 1073741830) ~s~0) .cse9 .cse11))) [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-38(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L242 CegarLoopResult]: At program point L1626-8(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-39(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L242 CegarLoopResult]: At program point L1626-9(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-40(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-41(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L242 CegarLoopResult]: At program point L1626-11(lines 1 1628) the Hoare annotation is: (let ((.cse6 (= ~SKIP2~0 ~s~0)) (.cse10 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse11 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse10 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~DC~0 7) ~s~0) .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 ~DC~0 1073741830) ~s~0) .cse9 .cse11))) [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-42(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-43(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L242 CegarLoopResult]: At program point L1626-13(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-44(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-45(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,859 INFO L246 CegarLoopResult]: For program point L1625-46(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,860 INFO L246 CegarLoopResult]: For program point L1625-47(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,860 INFO L242 CegarLoopResult]: At program point L1626-17(lines 1 1628) the Hoare annotation is: (let ((.cse24 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse25 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse8 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse2 (= ~s~0 ~NP~0)) (.cse21 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (<= (+ ~myStatus~0 1073741637) 0)) (.cse20 (= ~myStatus~0 0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= .cse25 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ .cse24 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse25)) (.cse22 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse23 (= ~MPR3~0 ~s~0)) (.cse15 (= 1 ~compRegistered~0)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse24) 3221225494))) (.cse18 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse19 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 (= ~myStatus~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse4 (<= (+ ~s~0 5) ~MPR3~0) .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse6 .cse5 .cse4 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse3 .cse6 .cse5 .cse4 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse23 .cse15 .cse17 .cse18 .cse19)))) [2019-12-07 13:00:42,860 INFO L246 CegarLoopResult]: For program point L1625-48(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,860 INFO L246 CegarLoopResult]: For program point L1625-49(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,860 INFO L246 CegarLoopResult]: For program point L1625-50(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,860 INFO L242 CegarLoopResult]: At program point L1626-20(lines 1 1628) the Hoare annotation is: (let ((.cse13 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (= ~MPR3~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= 0 ~pended~0)) (.cse19 (= ~s~0 ~NP~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse5 (<= .cse23 0)) (.cse20 (<= (+ ~s~0 5) ~MPR3~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ .cse22 1) 0)) (.cse21 (not .cse13)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse12 (<= 0 .cse23)) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse19 .cse2 .cse5 .cse20 .cse4 .cse3 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse21 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse19 .cse2 .cse5 .cse20 .cse4 .cse3 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse6 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,860 INFO L246 CegarLoopResult]: For program point L1625-51(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,860 INFO L246 CegarLoopResult]: For program point L1625-52(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-22(lines 1037 1050) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse2 (<= (+ ~s~0 5) ~IPC~0)) (.cse3 (= ~s~0 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= .cse19 0)) (.cse7 (<= (+ .cse18 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse19)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse16 .cse17) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-23(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-25(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse2 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse2 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse6 .cse5 .cse7 (= ~IPC~0 ~s~0)))) [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-26(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-28(lines 1 1628) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse0 (= 0 ~pended~0) .cse1 .cse2 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) .cse5) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5))) [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-30(lines 1 1628) the Hoare annotation is: (let ((.cse6 (= ~IPC~0 ~s~0)) (.cse7 (= 0 ~pended~0)) (.cse8 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= 1 ~pended~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (= ~SKIP2~0 ~s~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ~s~0 ~NP~0) .cse3 .cse5 (<= (+ ~s~0 5) ~MPR3~0)) (and .cse7 .cse2 .cse8 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse5 .cse10 .cse6 .cse11) (and .cse1 .cse7 .cse2 .cse8 .cse3 .cse4 .cse12 .cse9 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse10))) [2019-12-07 13:00:42,861 INFO L246 CegarLoopResult]: For program point L570(lines 570 577) no Hoare annotation was computed. [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-32(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,861 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,861 INFO L246 CegarLoopResult]: For program point L570-2(lines 570 577) no Hoare annotation was computed. [2019-12-07 13:00:42,861 INFO L242 CegarLoopResult]: At program point L1626-34(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse8) (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse3 .cse2 .cse4 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse7 .cse8))) [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1626-38(lines 1 1628) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= .cse18 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse12 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse11 (<= 0 .cse18)) (.cse13 (= 1 ~compRegistered~0)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse15 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~MPR3~0 ~s~0) .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse0 (= ~s~0 ~NP~0) .cse2 .cse4 .cse5 .cse3 .cse6 (not .cse12) .cse7 .cse8 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16)))) [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1626-41(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1626-43(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse8) (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse3 .cse2 .cse4 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse7 .cse8))) [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1626-44(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1626-46(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse8) (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse3 .cse2 .cse4 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse7 .cse8))) [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1626-47(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,862 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1626-49(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse8) (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse3 .cse2 .cse4 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse7 .cse8))) [2019-12-07 13:00:42,862 INFO L249 CegarLoopResult]: At program point L835(lines 665 837) the Hoare annotation is: true [2019-12-07 13:00:42,862 INFO L242 CegarLoopResult]: At program point L1101(lines 1101 1122) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0) .cse9))) [2019-12-07 13:00:42,863 INFO L242 CegarLoopResult]: At program point L1101-1(lines 1101 1122) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,863 INFO L242 CegarLoopResult]: At program point L705(lines 699 836) the Hoare annotation is: (let ((.cse32 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse33 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse12 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse15 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse22 (= 1 ~pended~0)) (.cse26 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse13 (not (= ULTIMATE.start_main_~status~1 259))) (.cse29 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse1 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse17 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse18 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse19 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (= 0 ~compRegistered~0)) (.cse20 (= ~IPC~0 ~s~0)) (.cse21 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse31 (<= (+ ~DC~0 7) ~s~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (= ~s~0 ~DC~0)) (.cse23 (<= .cse33 0)) (.cse16 (= ULTIMATE.start_main_~status~1 0)) (.cse24 (<= (+ .cse32 1) 0)) (.cse25 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse27 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse28 (<= 0 .cse33)) (.cse10 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse30 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse32) 3221225494))) (.cse11 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse2 .cse3 .cse4 .cse12 .cse7 .cse13 .cse14 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse2 .cse3 .cse4 .cse12 .cse7 .cse13 .cse14 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse3 .cse4 .cse15 .cse14) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse11 .cse20) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse20 .cse4 .cse7 .cse10 .cse11) (and .cse22 .cse2 .cse4 .cse6 .cse7 .cse20) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse3 .cse15 .cse14) (and .cse22 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11) (and .cse22 .cse4 .cse6 .cse14) (and .cse3 .cse14 .cse16 (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) (and .cse2 .cse3 .cse5 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse9 .cse14 .cse23 .cse24 .cse25 .cse4 .cse26 .cse7 .cse27 .cse13 .cse28 .cse10 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse29 .cse30 .cse11) (and .cse22 (= ~s~0 ~NP~0) .cse6 (<= (+ ~s~0 5) ~MPR3~0)) (and .cse2 .cse3 .cse5 .cse9 .cse14 .cse23 .cse24 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse25 .cse4 .cse26 .cse7 .cse27 .cse13 .cse28 .cse10 .cse29 .cse30 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 .cse20 .cse4 .cse7 .cse31 .cse10 .cse11) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19 .cse11) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse9 .cse20 .cse21 .cse4 .cse7 .cse31 .cse10 .cse11) (and (= ~myStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse2 .cse3 .cse5 .cse9 .cse14 .cse23 .cse16 .cse24 .cse25 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse4 .cse7 .cse27 .cse28 .cse10 .cse30 .cse11)))) [2019-12-07 13:00:42,863 INFO L242 CegarLoopResult]: At program point L838(lines 838 862) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse19 0)) (.cse7 (<= (+ .cse18 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse19)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17)))) [2019-12-07 13:00:42,863 INFO L246 CegarLoopResult]: For program point L1367(lines 1367 1534) no Hoare annotation was computed. [2019-12-07 13:00:42,863 INFO L246 CegarLoopResult]: For program point L972(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,863 INFO L242 CegarLoopResult]: At program point L972-1(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,863 INFO L246 CegarLoopResult]: For program point L972-2(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,863 INFO L242 CegarLoopResult]: At program point L972-3(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,863 INFO L246 CegarLoopResult]: For program point L972-4(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L242 CegarLoopResult]: At program point L972-5(lines 972 984) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= .cse18 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16)))) [2019-12-07 13:00:42,864 INFO L246 CegarLoopResult]: For program point L972-6(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L242 CegarLoopResult]: At program point L972-7(lines 972 984) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= .cse18 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16)))) [2019-12-07 13:00:42,864 INFO L246 CegarLoopResult]: For program point L972-8(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L242 CegarLoopResult]: At program point L972-9(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,864 INFO L246 CegarLoopResult]: For program point L972-10(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L242 CegarLoopResult]: At program point L972-11(lines 972 984) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse0 (= 0 ~pended~0) .cse1 .cse2 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) .cse5) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5))) [2019-12-07 13:00:42,864 INFO L246 CegarLoopResult]: For program point L972-12(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L242 CegarLoopResult]: At program point L972-13(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,864 INFO L246 CegarLoopResult]: For program point L972-14(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1503) no Hoare annotation was computed. [2019-12-07 13:00:42,864 INFO L242 CegarLoopResult]: At program point L972-15(lines 972 984) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L972-16(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L242 CegarLoopResult]: At program point L972-17(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L972-18(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L242 CegarLoopResult]: At program point L972-19(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L972-20(lines 972 984) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L242 CegarLoopResult]: At program point L972-21(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1120) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L1108-1(lines 1108 1120) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L242 CegarLoopResult]: At program point L1109(lines 1108 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,865 INFO L242 CegarLoopResult]: At program point L1109-1(lines 1108 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L1374(lines 1374 1532) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L317(lines 317 329) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L978(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L978-2(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,865 INFO L246 CegarLoopResult]: For program point L978-4(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-6(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L714(lines 714 717) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-8(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L714-2(lines 714 717) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-10(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L582(lines 582 587) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-12(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L582-2(lines 582 587) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-14(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-16(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-18(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L978-20(lines 978 982) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L242 CegarLoopResult]: At program point L1111(lines 1110 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,866 INFO L242 CegarLoopResult]: At program point L1111-1(lines 1110 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L246 CegarLoopResult]: For program point L848(lines 848 860) no Hoare annotation was computed. [2019-12-07 13:00:42,866 INFO L242 CegarLoopResult]: At program point L849(lines 848 860) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse19 0)) (.cse7 (<= (+ .cse18 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse19)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17)))) [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L322(lines 322 328) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L242 CegarLoopResult]: At program point L322-1(lines 1 1628) the Hoare annotation is: (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L242 CegarLoopResult]: At program point L851(lines 850 860) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse19 0)) (.cse7 (<= (+ .cse18 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse19)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse16 .cse17)))) [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L191(lines 191 193) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L191-2(lines 191 193) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1530) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L242 CegarLoopResult]: At program point L1382(lines 1374 1532) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L987(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L987-1(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L987-2(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L987-3(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L987-4(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L987-5(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,867 INFO L246 CegarLoopResult]: For program point L987-6(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,868 INFO L246 CegarLoopResult]: For program point L987-7(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,868 INFO L246 CegarLoopResult]: For program point L987-8(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,868 INFO L246 CegarLoopResult]: For program point L987-9(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,868 INFO L246 CegarLoopResult]: For program point L987-10(lines 987 1010) no Hoare annotation was computed. [2019-12-07 13:00:42,868 INFO L242 CegarLoopResult]: At program point L988(lines 987 1010) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,868 INFO L242 CegarLoopResult]: At program point L988-1(lines 987 1010) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,868 INFO L242 CegarLoopResult]: At program point L988-2(lines 987 1010) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= .cse18 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16)))) [2019-12-07 13:00:42,868 INFO L242 CegarLoopResult]: At program point L988-3(lines 987 1010) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 13:00:42,868 INFO L242 CegarLoopResult]: At program point L988-4(lines 987 1010) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,868 INFO L242 CegarLoopResult]: At program point L988-5(lines 987 1010) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse0 (= 0 ~pended~0) .cse1 .cse2 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) .cse5) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-12-07 13:00:42,868 INFO L242 CegarLoopResult]: At program point L988-6(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,869 INFO L242 CegarLoopResult]: At program point L988-7(lines 987 1010) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 13:00:42,869 INFO L242 CegarLoopResult]: At program point L988-8(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,869 INFO L242 CegarLoopResult]: At program point L988-9(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,869 INFO L242 CegarLoopResult]: At program point L988-10(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L196(lines 196 204) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L242 CegarLoopResult]: At program point L1123(lines 1123 1144) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_PsCreateSystemThread_#res| 1073741823) 0) .cse9) (and (= |ULTIMATE.start_PsCreateSystemThread_#res| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-12-07 13:00:42,869 INFO L242 CegarLoopResult]: At program point L1123-1(lines 1123 1144) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_PsCreateSystemThread_#res| 1073741823) 0) .cse9) (and (= |ULTIMATE.start_PsCreateSystemThread_#res| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1528) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L992(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L992-1(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L992-2(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L992-3(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L992-4(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,869 INFO L246 CegarLoopResult]: For program point L992-5(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,870 INFO L246 CegarLoopResult]: For program point L992-6(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,870 INFO L246 CegarLoopResult]: For program point L992-7(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,870 INFO L246 CegarLoopResult]: For program point L728(lines 728 776) no Hoare annotation was computed. [2019-12-07 13:00:42,870 INFO L246 CegarLoopResult]: For program point L992-8(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,870 INFO L246 CegarLoopResult]: For program point L992-9(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,870 INFO L246 CegarLoopResult]: For program point L992-10(lines 992 1009) no Hoare annotation was computed. [2019-12-07 13:00:42,870 INFO L242 CegarLoopResult]: At program point L993(lines 992 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,870 INFO L242 CegarLoopResult]: At program point L993-1(lines 992 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,870 INFO L242 CegarLoopResult]: At program point L993-2(lines 992 1009) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= .cse18 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16)))) [2019-12-07 13:00:42,870 INFO L242 CegarLoopResult]: At program point L993-3(lines 992 1009) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 13:00:42,870 INFO L242 CegarLoopResult]: At program point L993-4(lines 992 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,870 INFO L242 CegarLoopResult]: At program point L993-5(lines 992 1009) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse0 (= 0 ~pended~0) .cse1 .cse2 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) .cse5) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5))) [2019-12-07 13:00:42,870 INFO L242 CegarLoopResult]: At program point L993-6(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L993-7(lines 992 1009) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L729(lines 728 776) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L993-8(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L993-9(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L993-10(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L597(lines 432 599) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse2 (<= (+ ~s~0 5) ~IPC~0)) (.cse3 (= ~s~0 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= .cse19 0)) (.cse7 (<= (+ .cse18 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse19)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494))) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse2 (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse16 .cse17)))) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L995(lines 994 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L995-1(lines 994 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,871 INFO L242 CegarLoopResult]: At program point L995-2(lines 994 1009) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= .cse18 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16)))) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-3(lines 994 1009) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= .cse18 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16)))) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-4(lines 994 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L863(lines 863 883) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 (= ~SKIP2~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse8 .cse10))) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-5(lines 994 1009) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse0 (= 0 ~pended~0) .cse1 .cse2 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) .cse5) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5))) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-6(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-7(lines 994 1009) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-8(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-9(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,872 INFO L242 CegarLoopResult]: At program point L995-10(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,873 INFO L242 CegarLoopResult]: At program point L1524(lines 1399 1525) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (<= (+ ~s~0 5) ~MPR3~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) .cse2 .cse3 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))))) [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L733(lines 733 775) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L205(lines 205 424) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L1130(lines 1130 1142) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L1130-1(lines 1130 1142) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L242 CegarLoopResult]: At program point L734(lines 733 775) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1526) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L338(lines 338 343) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 343) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L242 CegarLoopResult]: At program point L206(lines 205 424) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-12-07 13:00:42,873 INFO L242 CegarLoopResult]: At program point L1131(lines 1130 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,873 INFO L242 CegarLoopResult]: At program point L1131-1(lines 1130 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,873 INFO L246 CegarLoopResult]: For program point L208(lines 208 423) no Hoare annotation was computed. [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L1133(lines 1132 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L1133-1(lines 1132 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,874 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,874 INFO L246 CegarLoopResult]: For program point L869(lines 869 881) no Hoare annotation was computed. [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L1398(lines 1388 1528) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L870(lines 869 881) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 (= ~SKIP2~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse8 .cse10))) [2019-12-07 13:00:42,874 INFO L246 CegarLoopResult]: For program point L738(lines 738 774) no Hoare annotation was computed. [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L739(lines 738 774) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L607(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L607-1(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L607-2(lines 600 609) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse14 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 .cse14)) (.cse12 (= 1 ~compRegistered~0)) (.cse13 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L607-3(lines 600 609) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= .cse14 0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 .cse14)) (.cse12 (= 1 ~compRegistered~0)) (.cse13 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2019-12-07 13:00:42,874 INFO L242 CegarLoopResult]: At program point L607-4(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L607-5(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L607-6(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L607-7(lines 600 609) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (and (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~setEventCalled~0 1))) [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L607-8(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L607-9(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L607-10(lines 600 609) the Hoare annotation is: false [2019-12-07 13:00:42,875 INFO L246 CegarLoopResult]: For program point L211(lines 211 422) no Hoare annotation was computed. [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L872(lines 871 881) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 (= ~SKIP2~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse8 .cse10))) [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L212(lines 208 423) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,875 INFO L246 CegarLoopResult]: For program point L214(lines 214 421) no Hoare annotation was computed. [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L1007(lines 971 1035) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= ~SKIP1~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 .cse5 .cse6 .cse7))) [2019-12-07 13:00:42,875 INFO L242 CegarLoopResult]: At program point L1007-1(lines 971 1035) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= ~SKIP1~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 .cse5 .cse6 .cse7))) [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-2(lines 971 1035) the Hoare annotation is: (let ((.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse21 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse20 (<= (+ ~myStatus~0 1073741637) 0)) (.cse0 (= ~myStatus~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse23 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ .cse22 1) 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (= ~MPR1~0 ~s~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (<= 0 .cse23)) (.cse19 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (= 1 ~compRegistered~0)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse18 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16 .cse20 .cse17 .cse18) (and .cse1 .cse2 .cse3 (= ~myStatus~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5 .cse6 .cse4 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse4 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16 .cse17 .cse18)))) [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-3(lines 971 1035) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= .cse19 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ .cse18 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse19)) (.cse17 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) (and (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16)))) [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-4(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-5(lines 971 1035) the Hoare annotation is: (let ((.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 1 ~pended~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (= ~SKIP1~0 ~s~0))) (or (and .cse0 (= 0 ~pended~0) .cse1 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 .cse4 .cse5 (<= (+ ~NP~0 4) ~MPR1~0) .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6))) [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-6(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-7(lines 971 1035) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse17 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (<= .cse17 0)) (.cse6 (<= (+ .cse16 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (= ~MPR1~0 ~s~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse12 (<= 0 .cse17)) (.cse13 (= 1 ~compRegistered~0)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494))) (.cse15 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse3 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))))) [2019-12-07 13:00:42,876 INFO L246 CegarLoopResult]: For program point L743(lines 743 773) no Hoare annotation was computed. [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-8(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,876 INFO L242 CegarLoopResult]: At program point L1007-9(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,877 INFO L242 CegarLoopResult]: At program point L1007-10(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 13:00:42,877 INFO L242 CegarLoopResult]: At program point L83(lines 705 777) the Hoare annotation is: (let ((.cse1 (+ ~s~0 5)) (.cse0 (+ ~s~0 2))) (and (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 ~SKIP2~0) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse0 ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-12-07 13:00:42,877 INFO L242 CegarLoopResult]: At program point L744(lines 743 773) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ~myStatus~0 1073741637) 0) .cse9))) [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point L1273(lines 1273 1285) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point L1273-2(lines 1272 1561) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point L217(lines 217 420) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L242 CegarLoopResult]: At program point L746(lines 745 773) the Hoare annotation is: (= ~NP~0 ~s~0) [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L242 CegarLoopResult]: At program point L218(lines 214 421) the Hoare annotation is: (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point L1409(lines 1409 1413) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L246 CegarLoopResult]: For program point L220(lines 220 419) no Hoare annotation was computed. [2019-12-07 13:00:42,877 INFO L242 CegarLoopResult]: At program point L1145(lines 1145 1165) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_FlQueueIrpToThread_~status~0 1073741823) 0) .cse7 .cse8 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_FlQueueIrpToThread_~status~0 0) .cse6 .cse7 .cse8 .cse9 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|)))) [2019-12-07 13:00:42,878 INFO L242 CegarLoopResult]: At program point L1145-1(lines 1145 1165) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1278(lines 1278 1283) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L242 CegarLoopResult]: At program point L221(lines 220 419) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-1(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-2(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-3(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-4(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-5(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-6(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-7(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-8(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-9(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1015-10(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L223(lines 223 418) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,878 INFO L246 CegarLoopResult]: For program point L1016-3(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L242 CegarLoopResult]: At program point L884(lines 884 906) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (not (= |ULTIMATE.start_IoQueryDeviceDescription_#res| 259)) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-6(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-9(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-12(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-15(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-18(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-21(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L242 CegarLoopResult]: At program point L224(lines 223 418) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-24(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-27(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L242 CegarLoopResult]: At program point L92(lines 88 94) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1016-30(lines 1016 1022) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L489(lines 489 501) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L358(lines 358 364) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L242 CegarLoopResult]: At program point L226(lines 225 418) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1151(lines 1151 1163) no Hoare annotation was computed. [2019-12-07 13:00:42,879 INFO L246 CegarLoopResult]: For program point L1151-1(lines 1151 1163) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L242 CegarLoopResult]: At program point L1152(lines 1151 1163) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_FlQueueIrpToThread_~status~0 1073741823) 0) .cse7 .cse8 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_FlQueueIrpToThread_~status~0 0) .cse6 .cse7 .cse8 .cse9 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|)))) [2019-12-07 13:00:42,880 INFO L242 CegarLoopResult]: At program point L1152-1(lines 1151 1163) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point L625(lines 625 627) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L242 CegarLoopResult]: At program point L1154(lines 1153 1163) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_FlQueueIrpToThread_~status~0 1073741823) 0) .cse7 .cse8 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_FlQueueIrpToThread_~status~0 0) .cse6 .cse7 .cse8 .cse9 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|)))) [2019-12-07 13:00:42,880 INFO L242 CegarLoopResult]: At program point L1154-1(lines 1153 1163) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point L494(lines 494 500) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L242 CegarLoopResult]: At program point L494-1(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (= 1 ~compRegistered~0)) (.cse10 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10))) [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point L1552(lines 1552 1558) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L242 CegarLoopResult]: At program point L1552-1(lines 1552 1558) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= ~s~0 ~DC~0)) (.cse4 (= 1 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) .cse2 .cse3 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse4 .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~s~0 ~NP~0) .cse1 .cse2 (<= (+ ~s~0 5) ~MPR3~0)))) [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point L1024(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point L1024-2(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,880 INFO L246 CegarLoopResult]: For program point L1024-4(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L892(lines 892 904) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-6(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-8(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-10(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-12(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-14(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-16(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-18(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point L1024-20(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L242 CegarLoopResult]: At program point L893(lines 892 904) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,881 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 13:00:42,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:00:42 BoogieIcfgContainer [2019-12-07 13:00:42,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:00:42,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:00:42,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:00:42,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:00:42,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:28" (3/4) ... [2019-12-07 13:00:42,977 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:00:43,002 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2019-12-07 13:00:43,005 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2019-12-07 13:00:43,008 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 13:00:43,011 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 13:00:43,034 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((\result + 1073741536 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && !(\result == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && ntStatus + 1073741536 <= 0)) || ((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && !(\result == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259))) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((0 == pended && s == DC) && status == 0) && \result == 0)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((1 == pended && s == NP) && 0 == compRegistered) && s + 5 <= MPR3)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && IPC == s) && lowerDriverReturn == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((myStatus == 0 && 0 == \result) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,034 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && \result + 1073741802 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && !(status == 259)) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((\result + 1073741536 <= 0 && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s + 5 <= IPC) && s == DC) && ntStatus + 1073741536 <= 0)) || (((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || ((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((0 == pended && s == DC) && status == 0) && \result == 0)) || ((((((((((((((((((myStatus == 0 && 0 == \result) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && IPC == s) && lowerDriverReturn == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259)) [2019-12-07 13:00:43,034 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259)) || ((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC)) || ((status == 0 && s == DC) && \result == 0)) || ((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && NP + 5 <= MPR3) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) && SKIP2 == s)) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || (((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((((((((((((((((((NP + DC + 7 <= IPC + SKIP1 && !(259 == \result)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && 259 <= \result) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && \result <= 259) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((((((((((((((((NP + DC + 7 <= IPC + SKIP1 && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && !(\result == 259)) && DC + 2 <= SKIP2) && s + 5 <= IPC) && !(status == 259)) && s == DC) && ntStatus + 1073741536 <= 0)) || (((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s) && IPC == s)) || (((((((((((((((((((myStatus == 0 && 0 == \result) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 <= \result) && lowerDriverReturn == \result) && \result <= 259) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,034 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \result + s + 1073741816 <= IPC) && s == DC) && s + ntStatus + 1073741816 <= IPC) && status + 1073741816 <= 0) || ((((((!(\result == 259) && returnVal2 + DC + 1073741825 <= s) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259)) && SKIP1 + 2 <= MPR1) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && \result + DC + 1073741825 <= s)) || ((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC)) || ((status == 0 && s == DC) && \result == 0)) || (((((((ntStatus == __cil_tmp91 && !(\result == 259)) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259))) || ((((NP + 5 <= MPR3 && status + 1073741813 <= 0) && s == DC) && \result + s + 1073741813 <= SKIP2) && ntStatus + DC + 1073741813 <= SKIP2)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || (((DC + 2 <= s && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)))) || ((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered)) || (((((((myStatus == 0 && ntStatus == 0) && 0 == \result) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && NP + 4 <= MPR1)) || ((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 2 <= s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((!(259 == \result) && !(ntStatus == 259)) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259)) && SKIP1 + 2 <= MPR1) && !(259 == \result)) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && !(259 == returnVal2)) && NP + 4 <= MPR1)) || (((((ntStatus + 1073741823 <= 0 && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status + 1073741823 <= 0) && \result + 1073741823 <= 0) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)))) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741536 <= 0 && !(\result == 259)) && !(status == 259)) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && ntStatus + 1073741536 <= 0)) || (((((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && s == DC) && \result == 0) && 0 == \result) && 0 == returnVal2)) || ((((((((!(ntStatus == 259) && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && !(status == 259)) && SKIP1 + 2 <= MPR1) && !(259 == ntStatus)) && !(259 == \result)) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && NP + 4 <= MPR1) [2019-12-07 13:00:43,035 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 [2019-12-07 13:00:43,035 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 [2019-12-07 13:00:43,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && s == DC) && status == 0) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((myStatus == 0 && 0 == \result) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((((((((((lowerDriverReturn == \result && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((lowerDriverReturn == \result && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-12-07 13:00:43,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-12-07 13:00:43,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) [2019-12-07 13:00:43,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (!(ntStatus == 259) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1))) [2019-12-07 13:00:43,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-12-07 13:00:43,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) [2019-12-07 13:00:43,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) [2019-12-07 13:00:43,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && 1 == compRegistered) && lowerDriverReturn == \result) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-12-07 13:00:43,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-12-07 13:00:43,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-12-07 13:00:43,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) [2019-12-07 13:00:43,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || (((((((((((((((((myStatus == 0 && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((ntStatus + 1073741823 <= 0 && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0)) || ((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) [2019-12-07 13:00:43,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && setEventCalled == 1 [2019-12-07 13:00:43,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && IPC == s) [2019-12-07 13:00:43,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && \result + DC + 1073741830 <= s) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || (((((((((\result + 1073741536 <= 0 && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((\result + 1073741738 <= 0 && 0 == pended) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((\result == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s == DC) && !(ntStatus == 259))) || (((((((((((\result == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-12-07 13:00:43,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 1 == compRegistered) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-12-07 13:00:43,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || ((((((((\result + 1073741536 <= 0 && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0) [2019-12-07 13:00:43,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) || ((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && setEventCalled == 1) [2019-12-07 13:00:43,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(259 == \result) && DC + 5 <= IPC) && 0 == pended) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && ntStatus + 1073741823 <= 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((((((((myStatus == 0 && !(259 == \result)) && DC + 5 <= IPC) && 0 == pended) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && ntStatus + 1073741823 <= 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-12-07 13:00:43,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && \result + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= MPR3) && status == 0) && \result + 1073741101 <= 0) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) [2019-12-07 13:00:43,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && \result + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741637 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus + 1073741637 <= 0) && ntStatus == 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || (((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && \result == 0) && NP + 4 <= MPR1) && ntStatus == 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && NP + 4 <= MPR1) && !(259 == __cil_tmp11)) && ntStatus == 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && \result + 1073741670 <= 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) || ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && \result == 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && NP + 4 <= MPR1) && !(259 == __cil_tmp11)) && ntStatus == 0) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || (((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && \result == 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && !(\result == 259)) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && ntStatus + 1073741670 <= 0) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && 0 == \result) && status == 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && ntStatus + 1073741670 <= 0) && s + 5 <= IPC) && \result + 1073741670 <= 0) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ntStatus == 0 && (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 0 == returnVal2) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1))) || ((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || (((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && status == 0) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && !(\result == 259)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == \result) && setEventCalled == 1) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == \result) && setEventCalled == 1) [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) || ((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && setEventCalled == 1) [2019-12-07 13:00:43,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) [2019-12-07 13:00:43,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-12-07 13:00:43,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) [2019-12-07 13:00:43,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) [2019-12-07 13:00:43,051 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) [2019-12-07 13:00:43,152 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d2e29dd5-d05a-4010-883e-8ca890389ab7/bin/uautomizer/witness.graphml [2019-12-07 13:00:43,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:00:43,153 INFO L168 Benchmark]: Toolchain (without parser) took 76263.84 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 779.1 MB). Free memory was 940.9 MB in the beginning and 1.2 GB in the end (delta: -287.8 MB). Peak memory consumption was 491.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:43,154 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:00:43,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:43,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.81 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:43,154 INFO L168 Benchmark]: Boogie Preprocessor took 61.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:43,155 INFO L168 Benchmark]: RCFGBuilder took 993.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 867.0 MB in the end (delta: 197.5 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:43,155 INFO L168 Benchmark]: TraceAbstraction took 74603.62 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 676.9 MB). Free memory was 867.0 MB in the beginning and 1.3 GB in the end (delta: -426.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 13:00:43,155 INFO L168 Benchmark]: Witness Printer took 178.27 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:43,156 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.81 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 993.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 867.0 MB in the end (delta: 197.5 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74603.62 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 676.9 MB). Free memory was 867.0 MB in the beginning and 1.3 GB in the end (delta: -426.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 178.27 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold - InvariantResult [Line: 1166]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1166]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: (((((((1 == pended && s == NP) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && NP + 4 <= MPR1) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && \result + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 1319]: Loop Invariant Derived loop invariant: (((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((((((((0 == pended && s == NP) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && NP + 4 <= MPR1) || (((((((((((ntStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && NP + 4 <= MPR1) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && 0 == \result) && status == 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 929]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 907]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 929]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1580]: Loop Invariant Derived loop invariant: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || ((((((((\result + 1073741536 <= 0 && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(259 == \result) && DC + 5 <= IPC) && 0 == pended) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && ntStatus + 1073741823 <= 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((((((((myStatus == 0 && !(259 == \result)) && DC + 5 <= IPC) && 0 == pended) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && ntStatus + 1073741823 <= 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((1 == pended && s == NP) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && NP + 4 <= MPR1) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((((ntStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741637 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus + 1073741637 <= 0) && ntStatus == 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || (((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && \result == 0) && NP + 4 <= MPR1) && ntStatus == 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && NP + 4 <= MPR1) && !(259 == __cil_tmp11)) && ntStatus == 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && \result + 1073741670 <= 0) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1153]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) - InvariantResult [Line: 1153]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && !(\result == 259)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && \result + 1073741802 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && !(status == 259)) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((\result + 1073741536 <= 0 && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s + 5 <= IPC) && s == DC) && ntStatus + 1073741536 <= 0)) || (((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || ((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((0 == pended && s == DC) && status == 0) && \result == 0)) || ((((((((((((((((((myStatus == 0 && 0 == \result) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && IPC == s) && lowerDriverReturn == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259)) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 786]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259)) || ((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC)) || ((status == 0 && s == DC) && \result == 0)) || ((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && NP + 5 <= MPR3) && \result == lowerDriverReturn) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) && SKIP2 == s)) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || (((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((((((((((((((((((NP + DC + 7 <= IPC + SKIP1 && !(259 == \result)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && 259 <= \result) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && \result <= 259) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((((((((((((((((NP + DC + 7 <= IPC + SKIP1 && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && !(\result == 259)) && DC + 2 <= SKIP2) && s + 5 <= IPC) && !(status == 259)) && s == DC) && ntStatus + 1073741536 <= 0)) || (((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s) && IPC == s)) || (((((((((((((((((((myStatus == 0 && 0 == \result) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 <= \result) && lowerDriverReturn == \result) && \result <= 259) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((\result + 1073741536 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && !(\result == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && ntStatus + 1073741536 <= 0)) || ((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && !(\result == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259))) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((0 == pended && s == DC) && status == 0) && \result == 0)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((1 == pended && s == NP) && 0 == compRegistered) && s + 5 <= MPR3)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && !(status == 259)) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((((lowerDriverReturn == status && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && IPC == s) && lowerDriverReturn == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((myStatus == 0 && 0 == \result) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s == DC) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1374]: Loop Invariant Derived loop invariant: (((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 1328]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1145]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) - InvariantResult [Line: 1123]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) - InvariantResult [Line: 1101]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) || ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) - InvariantResult [Line: 1145]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1123]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) - InvariantResult [Line: 1101]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 796]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \result + s + 1073741816 <= IPC) && s == DC) && s + ntStatus + 1073741816 <= IPC) && status + 1073741816 <= 0) || ((((((!(\result == 259) && returnVal2 + DC + 1073741825 <= s) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259)) && SKIP1 + 2 <= MPR1) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && \result + DC + 1073741825 <= s)) || ((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC)) || ((status == 0 && s == DC) && \result == 0)) || (((((((ntStatus == __cil_tmp91 && !(\result == 259)) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259))) || ((((NP + 5 <= MPR3 && status + 1073741813 <= 0) && s == DC) && \result + s + 1073741813 <= SKIP2) && ntStatus + DC + 1073741813 <= SKIP2)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || (((DC + 2 <= s && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)))) || ((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered)) || (((((((myStatus == 0 && ntStatus == 0) && 0 == \result) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && NP + 4 <= MPR1)) || ((((((((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 2 <= s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((!(259 == \result) && !(ntStatus == 259)) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259)) && SKIP1 + 2 <= MPR1) && !(259 == \result)) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && !(259 == returnVal2)) && NP + 4 <= MPR1)) || (((((ntStatus + 1073741823 <= 0 && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status + 1073741823 <= 0) && \result + 1073741823 <= 0) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)))) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741536 <= 0 && !(\result == 259)) && !(status == 259)) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && ntStatus + 1073741536 <= 0)) || (((((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && s == DC) && \result == 0) && 0 == \result) && 0 == returnVal2)) || ((((((((!(ntStatus == 259) && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && !(status == 259)) && SKIP1 + 2 <= MPR1) && !(259 == ntStatus)) && !(259 == \result)) && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2))) && NP + 4 <= MPR1) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (!(ntStatus == 259) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1))) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == returnVal2) && SKIP1 == s) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && s == DC) && status == 0) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && !(259 == \result)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((myStatus == 0 && 0 == \result) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((((((((((lowerDriverReturn == \result && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((lowerDriverReturn == \result && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((ntStatus == 0 && (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 0 == returnVal2) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1))) || ((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == returnVal2) && SKIP1 == s) - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: (((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s == DC) && !(ntStatus == 259)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == returnVal2) && SKIP1 == s) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered) && setEventCalled == 1 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: (((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && 1 == compRegistered) && lowerDriverReturn == \result) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && \result + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || (((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && !(ntStatus == 259)) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) || ((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered) && setEventCalled == 1) - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) || ((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered) && setEventCalled == 1) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 1 == compRegistered) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == \result) && setEventCalled == 1) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == \result) && setEventCalled == 1) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && IPC == s) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || (((((((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && IPC == s) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: (((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && setEventCalled == 1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: ((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) || ((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && setEventCalled == 1) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && \result == 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && NP + 4 <= MPR1) && !(259 == __cil_tmp11)) && ntStatus == 0) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: ((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) || ((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 1 == compRegistered) && setEventCalled == 1) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: ((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus + 1073741637 <= 0) && NP + 4 <= MPR1) - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) || (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 914]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 892]: Loop Invariant Derived loop invariant: ((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 838]: Loop Invariant Derived loop invariant: ((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= MPR3) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= MPR3) && status == 0) && \result + 1073741101 <= 0) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1346]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: ((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus + 1073741637 <= 0) && NP + 4 <= MPR1) - InvariantResult [Line: 705]: Loop Invariant Derived loop invariant: (((((((((((((myStatus == 0 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && s + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2 - InvariantResult [Line: 1563]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || (((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && \result == 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && !(\result == 259)) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || (((((((((((((((((myStatus == 0 && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((ntStatus + 1073741823 <= 0 && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0)) || ((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2)) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 894]: Loop Invariant Derived loop invariant: ((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || ((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s) && NP + 4 <= MPR1)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || (((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && ntStatus + 1073741670 <= 0) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == pended && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: NP == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && \result + 1073741802 <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 1108]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((1 == pended && s == NP) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && NP + 4 <= MPR1) - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || (((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && status == 0) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1130]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1108]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && ntStatus + 1073741670 <= 0) && s + 5 <= IPC) && \result + 1073741670 <= 0) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((0 == pended && NP + DC + 7 <= IPC + SKIP1) && !(259 == \result)) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && 1 == compRegistered) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1130]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 937]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && returnVal2 + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2) && IPC == s) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 871]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((0 == pended && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && ntStatus == lowerDriverReturn) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: (((((((((((ntStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus + 1073741637 <= 0) && NP + 4 <= MPR1) || (((((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && MPR1 == s) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || (((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && returnVal2 + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2) && IPC == s) - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 258 < __cil_tmp42) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1181]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && \result + DC + 1073741830 <= s) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || (((((((((\result + 1073741536 <= 0 && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && IPC == s)) || ((((\result + 1073741738 <= 0 && 0 == pended) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((\result == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && IPC == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s == DC) && !(ntStatus == 259))) || (((((((((((\result == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 259 == __cil_tmp11) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((1 == pended && s == NP) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && NP + 4 <= MPR1) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 937]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && \result + 1073741802 <= 0) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 570 locations, 53 error locations. Result: SAFE, OverallTime: 13.7s, OverallIterations: 64, TraceHistogramMax: 1, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 60.6s, HoareTripleCheckerStatistics: 29519 SDtfs, 28784 SDslu, 62511 SDs, 0 SdLazy, 9738 SolverSat, 913 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 609 GetRequests, 161 SyntacticMatches, 4 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=723occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 64 MinimizatonAttempts, 4446 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 216 LocationsWithAnnotation, 216 PreInvPairs, 832 NumberOfFragments, 23763 HoareAnnotationTreeSize, 216 FomulaSimplifications, 2869622058352307 FormulaSimplificationTreeSizeReduction, 8.3s HoareSimplificationTime, 216 FomulaSimplificationsInter, 454811986475126 FormulaSimplificationTreeSizeReductionInter, 52.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2781 NumberOfCodeBlocks, 2781 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2717 ConstructedInterpolants, 0 QuantifiedInterpolants, 325163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 64 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...