./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.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_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b1a240fd075ce2cb4ef354f75e9bf02a7f7ab6f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:51:01,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:51:01,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:51:01,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:51:01,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:51:01,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:51:01,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:51:01,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:51:01,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:51:01,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:51:01,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:51:01,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:51:01,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:51:01,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:51:01,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:51:01,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:51:01,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:51:01,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:51:01,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:51:01,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:51:01,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:51:01,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:51:01,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:51:01,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:51:01,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:51:01,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:51:01,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:51:01,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:51:01,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:51:01,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:51:01,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:51:01,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:51:01,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:51:01,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:51:01,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:51:01,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:51:01,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:51:01,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:51:01,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:51:01,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:51:01,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:51:01,690 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:51:01,699 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:51:01,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:51:01,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:51:01,700 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:51:01,700 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:51:01,700 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:51:01,700 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:51:01,700 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:51:01,700 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:51:01,700 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:51:01,700 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:51:01,701 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:51:01,701 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:51:01,701 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:51:01,701 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:51:01,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:51:01,702 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:51:01,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:51:01,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:51:01,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:51:01,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:51:01,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:51:01,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:51:01,703 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:51:01,703 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:51:01,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:51:01,703 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:51:01,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:51:01,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:51:01,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:51:01,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:51:01,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:51:01,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:51:01,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:51:01,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:51:01,704 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:51:01,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:51:01,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:51:01,705 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:51:01,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:51:01,705 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan 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 -> Taipan 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 -> 9b1a240fd075ce2cb4ef354f75e9bf02a7f7ab6f [2019-12-07 11:51:01,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:51:01,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:51:01,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:51:01,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:51:01,816 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:51:01,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-12-07 11:51:01,854 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/data/54238b262/17622998f8f440f19118899db1460f88/FLAG651b93326 [2019-12-07 11:51:02,365 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:51:02,366 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-12-07 11:51:02,375 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/data/54238b262/17622998f8f440f19118899db1460f88/FLAG651b93326 [2019-12-07 11:51:02,884 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/data/54238b262/17622998f8f440f19118899db1460f88 [2019-12-07 11:51:02,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:51:02,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:51:02,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:51:02,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:51:02,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:51:02,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:51:02" (1/1) ... [2019-12-07 11:51:02,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707e4dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:02, skipping insertion in model container [2019-12-07 11:51:02,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:51:02" (1/1) ... [2019-12-07 11:51:02,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:51:02,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:51:03,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:51:03,143 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:51:03,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:51:03,204 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:51:03,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03 WrapperNode [2019-12-07 11:51:03,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:51:03,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:51:03,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:51:03,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:51:03,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:51:03,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:51:03,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:51:03,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:51:03,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... [2019-12-07 11:51:03,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:51:03,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:51:03,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:51:03,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:51:03,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/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 11:51:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:51:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:51:03,481 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,487 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,494 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,498 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,500 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,505 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,508 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,511 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,512 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,513 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,517 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,520 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,521 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,522 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,524 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,526 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,529 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,531 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,533 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,535 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,536 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,537 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,538 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:03,539 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:51:04,042 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2019-12-07 11:51:04,042 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2019-12-07 11:51:04,042 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2019-12-07 11:51:04,042 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2019-12-07 11:51:04,042 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-12-07 11:51:04,043 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2019-12-07 11:51:04,044 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2019-12-07 11:51:04,045 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 11:51:04,045 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 11:51:04,045 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2019-12-07 11:51:04,045 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2019-12-07 11:51:04,045 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2019-12-07 11:51:04,045 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2019-12-07 11:51:04,045 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2019-12-07 11:51:04,046 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-12-07 11:51:04,047 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2019-12-07 11:51:04,047 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-12-07 11:51:04,047 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2019-12-07 11:51:04,047 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2019-12-07 11:51:04,047 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2019-12-07 11:51:04,048 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2019-12-07 11:51:04,048 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2019-12-07 11:51:04,048 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2019-12-07 11:51:04,048 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2019-12-07 11:51:04,048 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2019-12-07 11:51:04,658 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:51:04,659 INFO L287 CfgBuilder]: Removed 205 assume(true) statements. [2019-12-07 11:51:04,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:04 BoogieIcfgContainer [2019-12-07 11:51:04,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:51:04,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:51:04,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:51:04,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:51:04,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:51:02" (1/3) ... [2019-12-07 11:51:04,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456a3e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:51:04, skipping insertion in model container [2019-12-07 11:51:04,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:03" (2/3) ... [2019-12-07 11:51:04,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456a3e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:51:04, skipping insertion in model container [2019-12-07 11:51:04,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:04" (3/3) ... [2019-12-07 11:51:04,665 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-12-07 11:51:04,671 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:51:04,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 40 error locations. [2019-12-07 11:51:04,684 INFO L249 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2019-12-07 11:51:04,702 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:51:04,702 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:51:04,702 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:51:04,702 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:51:04,702 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:51:04,702 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:51:04,702 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:51:04,702 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:51:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-12-07 11:51:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:51:04,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:04,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:04,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1049040111, now seen corresponding path program 1 times [2019-12-07 11:51:04,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:04,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095852636] [2019-12-07 11:51:04,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:04,858 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 11:51:04,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095852636] [2019-12-07 11:51:04,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:04,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:04,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367951752] [2019-12-07 11:51:04,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:04,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:04,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:04,875 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2019-12-07 11:51:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:05,043 INFO L93 Difference]: Finished difference Result 480 states and 716 transitions. [2019-12-07 11:51:05,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:05,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:51:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:05,053 INFO L225 Difference]: With dead ends: 480 [2019-12-07 11:51:05,054 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 11:51:05,056 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 11:51:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 11:51:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-12-07 11:51:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 11:51:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 340 transitions. [2019-12-07 11:51:05,093 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 340 transitions. Word has length 7 [2019-12-07 11:51:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:05,094 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 340 transitions. [2019-12-07 11:51:05,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2019-12-07 11:51:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:51:05,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:05,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:05,095 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:05,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:05,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1248421914, now seen corresponding path program 1 times [2019-12-07 11:51:05,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:05,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412658195] [2019-12-07 11:51:05,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:05,133 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 11:51:05,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412658195] [2019-12-07 11:51:05,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:05,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:05,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670155653] [2019-12-07 11:51:05,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:05,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:05,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:05,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:05,135 INFO L87 Difference]: Start difference. First operand 256 states and 340 transitions. Second operand 3 states. [2019-12-07 11:51:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:05,171 INFO L93 Difference]: Finished difference Result 472 states and 620 transitions. [2019-12-07 11:51:05,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:05,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 11:51:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:05,173 INFO L225 Difference]: With dead ends: 472 [2019-12-07 11:51:05,173 INFO L226 Difference]: Without dead ends: 330 [2019-12-07 11:51:05,175 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 11:51:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-12-07 11:51:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2019-12-07 11:51:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-07 11:51:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2019-12-07 11:51:05,188 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 9 [2019-12-07 11:51:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:05,188 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2019-12-07 11:51:05,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2019-12-07 11:51:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:51:05,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:05,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:05,189 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:05,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1214940225, now seen corresponding path program 1 times [2019-12-07 11:51:05,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:05,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717828111] [2019-12-07 11:51:05,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:05,204 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 11:51:05,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717828111] [2019-12-07 11:51:05,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:05,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:51:05,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149989703] [2019-12-07 11:51:05,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:05,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:05,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:05,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:05,206 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 3 states. [2019-12-07 11:51:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:05,217 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2019-12-07 11:51:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:05,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 11:51:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:05,219 INFO L225 Difference]: With dead ends: 263 [2019-12-07 11:51:05,219 INFO L226 Difference]: Without dead ends: 244 [2019-12-07 11:51:05,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:51:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-07 11:51:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2019-12-07 11:51:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-07 11:51:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 322 transitions. [2019-12-07 11:51:05,228 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 322 transitions. Word has length 10 [2019-12-07 11:51:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:05,229 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 322 transitions. [2019-12-07 11:51:05,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 322 transitions. [2019-12-07 11:51:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:51:05,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:05,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:05,230 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:05,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash -452514309, now seen corresponding path program 1 times [2019-12-07 11:51:05,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:05,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885443147] [2019-12-07 11:51:05,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:05,255 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 11:51:05,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885443147] [2019-12-07 11:51:05,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:05,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:05,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658949776] [2019-12-07 11:51:05,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:05,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:05,257 INFO L87 Difference]: Start difference. First operand 244 states and 322 transitions. Second operand 3 states. [2019-12-07 11:51:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:05,276 INFO L93 Difference]: Finished difference Result 301 states and 390 transitions. [2019-12-07 11:51:05,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:05,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 11:51:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:05,278 INFO L225 Difference]: With dead ends: 301 [2019-12-07 11:51:05,278 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 11:51:05,278 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 11:51:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 11:51:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2019-12-07 11:51:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 11:51:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 348 transitions. [2019-12-07 11:51:05,287 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 348 transitions. Word has length 13 [2019-12-07 11:51:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:05,288 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 348 transitions. [2019-12-07 11:51:05,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2019-12-07 11:51:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:51:05,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:05,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:05,290 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash -314161949, now seen corresponding path program 1 times [2019-12-07 11:51:05,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:05,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213151288] [2019-12-07 11:51:05,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:05,322 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 11:51:05,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213151288] [2019-12-07 11:51:05,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:05,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:05,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688467034] [2019-12-07 11:51:05,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:05,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:05,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:05,323 INFO L87 Difference]: Start difference. First operand 262 states and 348 transitions. Second operand 3 states. [2019-12-07 11:51:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:05,419 INFO L93 Difference]: Finished difference Result 335 states and 441 transitions. [2019-12-07 11:51:05,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:05,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 11:51:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:05,421 INFO L225 Difference]: With dead ends: 335 [2019-12-07 11:51:05,421 INFO L226 Difference]: Without dead ends: 327 [2019-12-07 11:51:05,421 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 11:51:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-07 11:51:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 274. [2019-12-07 11:51:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-07 11:51:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 366 transitions. [2019-12-07 11:51:05,434 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 366 transitions. Word has length 16 [2019-12-07 11:51:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:05,434 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 366 transitions. [2019-12-07 11:51:05,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 366 transitions. [2019-12-07 11:51:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:51:05,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:05,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:05,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash -836310948, now seen corresponding path program 1 times [2019-12-07 11:51:05,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:05,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003271739] [2019-12-07 11:51:05,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:05,458 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 11:51:05,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003271739] [2019-12-07 11:51:05,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:05,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:05,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628956097] [2019-12-07 11:51:05,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:05,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:05,459 INFO L87 Difference]: Start difference. First operand 274 states and 366 transitions. Second operand 3 states. [2019-12-07 11:51:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:05,550 INFO L93 Difference]: Finished difference Result 296 states and 392 transitions. [2019-12-07 11:51:05,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:05,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 11:51:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:05,551 INFO L225 Difference]: With dead ends: 296 [2019-12-07 11:51:05,551 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 11:51:05,552 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 11:51:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 11:51:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-12-07 11:51:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 11:51:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2019-12-07 11:51:05,560 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 387 transitions. Word has length 16 [2019-12-07 11:51:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:05,560 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 387 transitions. [2019-12-07 11:51:05,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 387 transitions. [2019-12-07 11:51:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:51:05,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:05,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:05,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:05,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:05,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1776532247, now seen corresponding path program 1 times [2019-12-07 11:51:05,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:05,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552662106] [2019-12-07 11:51:05,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:05,586 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 11:51:05,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552662106] [2019-12-07 11:51:05,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:05,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:05,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066653293] [2019-12-07 11:51:05,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:05,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:05,587 INFO L87 Difference]: Start difference. First operand 291 states and 387 transitions. Second operand 3 states. [2019-12-07 11:51:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:05,673 INFO L93 Difference]: Finished difference Result 397 states and 529 transitions. [2019-12-07 11:51:05,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:05,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:51:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:05,674 INFO L225 Difference]: With dead ends: 397 [2019-12-07 11:51:05,675 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 11:51:05,675 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 11:51:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 11:51:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-12-07 11:51:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 11:51:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 383 transitions. [2019-12-07 11:51:05,683 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 383 transitions. Word has length 17 [2019-12-07 11:51:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:05,683 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 383 transitions. [2019-12-07 11:51:05,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 383 transitions. [2019-12-07 11:51:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:51:05,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:05,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:05,684 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:05,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1156744329, now seen corresponding path program 1 times [2019-12-07 11:51:05,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:05,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179130645] [2019-12-07 11:51:05,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:05,737 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 11:51:05,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179130645] [2019-12-07 11:51:05,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:05,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:51:05,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124202153] [2019-12-07 11:51:05,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:51:05,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:51:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:51:05,739 INFO L87 Difference]: Start difference. First operand 288 states and 383 transitions. Second operand 7 states. [2019-12-07 11:51:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,021 INFO L93 Difference]: Finished difference Result 343 states and 449 transitions. [2019-12-07 11:51:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:51:06,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 11:51:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,023 INFO L225 Difference]: With dead ends: 343 [2019-12-07 11:51:06,023 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 11:51:06,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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 11:51:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 11:51:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2019-12-07 11:51:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 11:51:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 368 transitions. [2019-12-07 11:51:06,032 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 368 transitions. Word has length 17 [2019-12-07 11:51:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,032 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 368 transitions. [2019-12-07 11:51:06,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:51:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 368 transitions. [2019-12-07 11:51:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:51:06,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:06,033 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1781970427, now seen corresponding path program 1 times [2019-12-07 11:51:06,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645517950] [2019-12-07 11:51:06,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,048 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 11:51:06,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645517950] [2019-12-07 11:51:06,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:06,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466881899] [2019-12-07 11:51:06,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:06,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:06,050 INFO L87 Difference]: Start difference. First operand 280 states and 368 transitions. Second operand 3 states. [2019-12-07 11:51:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,126 INFO L93 Difference]: Finished difference Result 280 states and 368 transitions. [2019-12-07 11:51:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:06,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:51:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,127 INFO L225 Difference]: With dead ends: 280 [2019-12-07 11:51:06,127 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 11:51:06,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 11:51:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 11:51:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-12-07 11:51:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-07 11:51:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2019-12-07 11:51:06,135 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 17 [2019-12-07 11:51:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,136 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2019-12-07 11:51:06,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2019-12-07 11:51:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:51:06,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:06,137 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -138379543, now seen corresponding path program 1 times [2019-12-07 11:51:06,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981619630] [2019-12-07 11:51:06,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,154 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 11:51:06,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981619630] [2019-12-07 11:51:06,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:51:06,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543884329] [2019-12-07 11:51:06,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:06,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:06,155 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand 4 states. [2019-12-07 11:51:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,179 INFO L93 Difference]: Finished difference Result 281 states and 369 transitions. [2019-12-07 11:51:06,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:51:06,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 11:51:06,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,180 INFO L225 Difference]: With dead ends: 281 [2019-12-07 11:51:06,180 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 11:51:06,181 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 11:51:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 11:51:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-12-07 11:51:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 11:51:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2019-12-07 11:51:06,188 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 17 [2019-12-07 11:51:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,189 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2019-12-07 11:51:06,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:51:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2019-12-07 11:51:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:51:06,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,189 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 11:51:06,190 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash -860989659, now seen corresponding path program 1 times [2019-12-07 11:51:06,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497691539] [2019-12-07 11:51:06,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,208 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 11:51:06,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497691539] [2019-12-07 11:51:06,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:06,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593389607] [2019-12-07 11:51:06,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:06,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:06,209 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand 3 states. [2019-12-07 11:51:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,229 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2019-12-07 11:51:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:06,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:51:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,231 INFO L225 Difference]: With dead ends: 363 [2019-12-07 11:51:06,231 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 11:51:06,231 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 11:51:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 11:51:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 248. [2019-12-07 11:51:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-07 11:51:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2019-12-07 11:51:06,238 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 19 [2019-12-07 11:51:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,238 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2019-12-07 11:51:06,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2019-12-07 11:51:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:51:06,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,239 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 11:51:06,239 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash -577385694, now seen corresponding path program 1 times [2019-12-07 11:51:06,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011786421] [2019-12-07 11:51:06,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,259 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 11:51:06,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011786421] [2019-12-07 11:51:06,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:06,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76245048] [2019-12-07 11:51:06,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:06,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:06,260 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand 3 states. [2019-12-07 11:51:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,281 INFO L93 Difference]: Finished difference Result 365 states and 468 transitions. [2019-12-07 11:51:06,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:06,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 11:51:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,282 INFO L225 Difference]: With dead ends: 365 [2019-12-07 11:51:06,282 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 11:51:06,283 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 11:51:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 11:51:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 236. [2019-12-07 11:51:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 11:51:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2019-12-07 11:51:06,290 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 20 [2019-12-07 11:51:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,291 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2019-12-07 11:51:06,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2019-12-07 11:51:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:51:06,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,291 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] [2019-12-07 11:51:06,292 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1425584408, now seen corresponding path program 1 times [2019-12-07 11:51:06,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083269450] [2019-12-07 11:51:06,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,392 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 11:51:06,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083269450] [2019-12-07 11:51:06,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:06,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444630254] [2019-12-07 11:51:06,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:06,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:06,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:06,393 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand 3 states. [2019-12-07 11:51:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,424 INFO L93 Difference]: Finished difference Result 336 states and 430 transitions. [2019-12-07 11:51:06,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:06,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 11:51:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,426 INFO L225 Difference]: With dead ends: 336 [2019-12-07 11:51:06,426 INFO L226 Difference]: Without dead ends: 238 [2019-12-07 11:51:06,427 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 11:51:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-07 11:51:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 224. [2019-12-07 11:51:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 11:51:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2019-12-07 11:51:06,439 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 21 [2019-12-07 11:51:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,439 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2019-12-07 11:51:06,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2019-12-07 11:51:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:51:06,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,440 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] [2019-12-07 11:51:06,440 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash 562843807, now seen corresponding path program 1 times [2019-12-07 11:51:06,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776992011] [2019-12-07 11:51:06,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,477 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 11:51:06,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776992011] [2019-12-07 11:51:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:06,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48190138] [2019-12-07 11:51:06,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:06,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:06,478 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand 4 states. [2019-12-07 11:51:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,582 INFO L93 Difference]: Finished difference Result 310 states and 395 transitions. [2019-12-07 11:51:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:51:06,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 11:51:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,584 INFO L225 Difference]: With dead ends: 310 [2019-12-07 11:51:06,584 INFO L226 Difference]: Without dead ends: 224 [2019-12-07 11:51:06,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 11:51:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-12-07 11:51:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-12-07 11:51:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 11:51:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 283 transitions. [2019-12-07 11:51:06,592 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 283 transitions. Word has length 22 [2019-12-07 11:51:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,593 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 283 transitions. [2019-12-07 11:51:06,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:51:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 283 transitions. [2019-12-07 11:51:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:51:06,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,593 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 11:51:06,594 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2122628294, now seen corresponding path program 1 times [2019-12-07 11:51:06,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163134624] [2019-12-07 11:51:06,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,643 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 11:51:06,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163134624] [2019-12-07 11:51:06,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:51:06,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554590319] [2019-12-07 11:51:06,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:51:06,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:51:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:06,644 INFO L87 Difference]: Start difference. First operand 224 states and 283 transitions. Second operand 5 states. [2019-12-07 11:51:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,836 INFO L93 Difference]: Finished difference Result 291 states and 364 transitions. [2019-12-07 11:51:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:51:06,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 11:51:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,837 INFO L225 Difference]: With dead ends: 291 [2019-12-07 11:51:06,837 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 11:51:06,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:51:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 11:51:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 224. [2019-12-07 11:51:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 11:51:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 283 transitions. [2019-12-07 11:51:06,850 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 283 transitions. Word has length 23 [2019-12-07 11:51:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,850 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 283 transitions. [2019-12-07 11:51:06,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:51:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 283 transitions. [2019-12-07 11:51:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:51:06,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,851 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 11:51:06,851 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1926038797, now seen corresponding path program 1 times [2019-12-07 11:51:06,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236540702] [2019-12-07 11:51:06,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,873 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 11:51:06,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236540702] [2019-12-07 11:51:06,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:51:06,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240042608] [2019-12-07 11:51:06,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:51:06,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:51:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:06,874 INFO L87 Difference]: Start difference. First operand 224 states and 283 transitions. Second operand 5 states. [2019-12-07 11:51:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:06,927 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2019-12-07 11:51:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:51:06,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 11:51:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:06,929 INFO L225 Difference]: With dead ends: 238 [2019-12-07 11:51:06,929 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 11:51:06,929 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 11:51:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 11:51:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 11:51:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 11:51:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 271 transitions. [2019-12-07 11:51:06,946 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 271 transitions. Word has length 24 [2019-12-07 11:51:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:06,946 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 271 transitions. [2019-12-07 11:51:06,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:51:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 271 transitions. [2019-12-07 11:51:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:51:06,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:06,948 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 11:51:06,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1277371961, now seen corresponding path program 1 times [2019-12-07 11:51:06,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:06,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318094757] [2019-12-07 11:51:06,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:06,977 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 11:51:06,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318094757] [2019-12-07 11:51:06,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:06,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:06,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653552338] [2019-12-07 11:51:06,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:06,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:06,978 INFO L87 Difference]: Start difference. First operand 216 states and 271 transitions. Second operand 3 states. [2019-12-07 11:51:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:07,057 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2019-12-07 11:51:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:07,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 11:51:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:07,058 INFO L225 Difference]: With dead ends: 255 [2019-12-07 11:51:07,058 INFO L226 Difference]: Without dead ends: 247 [2019-12-07 11:51:07,059 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 11:51:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-07 11:51:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 237. [2019-12-07 11:51:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:51:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 295 transitions. [2019-12-07 11:51:07,069 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 295 transitions. Word has length 24 [2019-12-07 11:51:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:07,069 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 295 transitions. [2019-12-07 11:51:07,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2019-12-07 11:51:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:51:07,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:07,070 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 11:51:07,070 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash 961293112, now seen corresponding path program 1 times [2019-12-07 11:51:07,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:07,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149943239] [2019-12-07 11:51:07,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:07,096 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 11:51:07,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149943239] [2019-12-07 11:51:07,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:07,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:51:07,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225757668] [2019-12-07 11:51:07,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:51:07,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:51:07,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:07,098 INFO L87 Difference]: Start difference. First operand 237 states and 295 transitions. Second operand 5 states. [2019-12-07 11:51:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:07,256 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2019-12-07 11:51:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:51:07,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 11:51:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:07,258 INFO L225 Difference]: With dead ends: 253 [2019-12-07 11:51:07,258 INFO L226 Difference]: Without dead ends: 245 [2019-12-07 11:51:07,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 11:51:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-07 11:51:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 237. [2019-12-07 11:51:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:51:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 294 transitions. [2019-12-07 11:51:07,275 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 294 transitions. Word has length 25 [2019-12-07 11:51:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:07,275 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 294 transitions. [2019-12-07 11:51:07,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:51:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2019-12-07 11:51:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:51:07,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:07,276 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 11:51:07,277 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash -58105058, now seen corresponding path program 1 times [2019-12-07 11:51:07,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:07,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132506645] [2019-12-07 11:51:07,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:07,301 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 11:51:07,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132506645] [2019-12-07 11:51:07,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:07,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:07,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371462609] [2019-12-07 11:51:07,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:07,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:07,302 INFO L87 Difference]: Start difference. First operand 237 states and 294 transitions. Second operand 4 states. [2019-12-07 11:51:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:07,399 INFO L93 Difference]: Finished difference Result 271 states and 331 transitions. [2019-12-07 11:51:07,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:51:07,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 11:51:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:07,400 INFO L225 Difference]: With dead ends: 271 [2019-12-07 11:51:07,400 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 11:51:07,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 11:51:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 11:51:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-12-07 11:51:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:51:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 287 transitions. [2019-12-07 11:51:07,412 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 287 transitions. Word has length 25 [2019-12-07 11:51:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:07,412 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 287 transitions. [2019-12-07 11:51:07,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:51:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 287 transitions. [2019-12-07 11:51:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:51:07,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:07,413 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 11:51:07,413 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash -110094717, now seen corresponding path program 1 times [2019-12-07 11:51:07,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:07,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052818457] [2019-12-07 11:51:07,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:07,447 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 11:51:07,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052818457] [2019-12-07 11:51:07,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:07,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:51:07,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483287470] [2019-12-07 11:51:07,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:51:07,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:07,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:51:07,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:07,449 INFO L87 Difference]: Start difference. First operand 237 states and 287 transitions. Second operand 5 states. [2019-12-07 11:51:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:07,602 INFO L93 Difference]: Finished difference Result 257 states and 313 transitions. [2019-12-07 11:51:07,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:51:07,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 11:51:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:07,604 INFO L225 Difference]: With dead ends: 257 [2019-12-07 11:51:07,604 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 11:51:07,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:51:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 11:51:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2019-12-07 11:51:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:51:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 287 transitions. [2019-12-07 11:51:07,621 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 287 transitions. Word has length 25 [2019-12-07 11:51:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:07,621 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 287 transitions. [2019-12-07 11:51:07,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:51:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 287 transitions. [2019-12-07 11:51:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:51:07,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:07,622 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 11:51:07,622 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash -794310412, now seen corresponding path program 1 times [2019-12-07 11:51:07,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:07,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509694926] [2019-12-07 11:51:07,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:07,643 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 11:51:07,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509694926] [2019-12-07 11:51:07,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:07,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:07,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486347594] [2019-12-07 11:51:07,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:07,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:07,645 INFO L87 Difference]: Start difference. First operand 237 states and 287 transitions. Second operand 4 states. [2019-12-07 11:51:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:07,742 INFO L93 Difference]: Finished difference Result 245 states and 294 transitions. [2019-12-07 11:51:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:51:07,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 11:51:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:07,744 INFO L225 Difference]: With dead ends: 245 [2019-12-07 11:51:07,744 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 11:51:07,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 11:51:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 11:51:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 11:51:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 11:51:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 257 transitions. [2019-12-07 11:51:07,760 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 257 transitions. Word has length 26 [2019-12-07 11:51:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:07,760 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 257 transitions. [2019-12-07 11:51:07,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:51:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 257 transitions. [2019-12-07 11:51:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:51:07,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:07,761 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 11:51:07,762 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1698630850, now seen corresponding path program 1 times [2019-12-07 11:51:07,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:07,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807284922] [2019-12-07 11:51:07,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:07,780 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 11:51:07,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807284922] [2019-12-07 11:51:07,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:07,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:07,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848563382] [2019-12-07 11:51:07,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:07,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:07,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:07,781 INFO L87 Difference]: Start difference. First operand 216 states and 257 transitions. Second operand 3 states. [2019-12-07 11:51:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:07,841 INFO L93 Difference]: Finished difference Result 231 states and 270 transitions. [2019-12-07 11:51:07,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:07,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 11:51:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:07,842 INFO L225 Difference]: With dead ends: 231 [2019-12-07 11:51:07,843 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 11:51:07,843 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 11:51:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 11:51:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2019-12-07 11:51:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 11:51:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 251 transitions. [2019-12-07 11:51:07,853 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 251 transitions. Word has length 26 [2019-12-07 11:51:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:07,853 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 251 transitions. [2019-12-07 11:51:07,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 251 transitions. [2019-12-07 11:51:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:51:07,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:07,854 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 11:51:07,854 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash -943840679, now seen corresponding path program 1 times [2019-12-07 11:51:07,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:07,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75405988] [2019-12-07 11:51:07,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:07,880 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 11:51:07,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75405988] [2019-12-07 11:51:07,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:07,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:51:07,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144813954] [2019-12-07 11:51:07,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:07,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:07,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:07,881 INFO L87 Difference]: Start difference. First operand 212 states and 251 transitions. Second operand 4 states. [2019-12-07 11:51:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:07,956 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2019-12-07 11:51:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:51:07,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 11:51:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:07,957 INFO L225 Difference]: With dead ends: 244 [2019-12-07 11:51:07,957 INFO L226 Difference]: Without dead ends: 238 [2019-12-07 11:51:07,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-07 11:51:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2019-12-07 11:51:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 11:51:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2019-12-07 11:51:07,967 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 27 [2019-12-07 11:51:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:07,967 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2019-12-07 11:51:07,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:51:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2019-12-07 11:51:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:51:07,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:07,968 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 11:51:07,968 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1100480813, now seen corresponding path program 1 times [2019-12-07 11:51:07,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:07,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155042592] [2019-12-07 11:51:07,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:08,005 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 11:51:08,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155042592] [2019-12-07 11:51:08,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:08,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:51:08,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608445176] [2019-12-07 11:51:08,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:51:08,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:08,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:51:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:08,006 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand 5 states. [2019-12-07 11:51:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:08,115 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2019-12-07 11:51:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:51:08,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:51:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:08,117 INFO L225 Difference]: With dead ends: 212 [2019-12-07 11:51:08,117 INFO L226 Difference]: Without dead ends: 209 [2019-12-07 11:51:08,117 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 11:51:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-07 11:51:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2019-12-07 11:51:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-07 11:51:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 242 transitions. [2019-12-07 11:51:08,127 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 242 transitions. Word has length 27 [2019-12-07 11:51:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:08,127 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 242 transitions. [2019-12-07 11:51:08,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:51:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 242 transitions. [2019-12-07 11:51:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:51:08,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:08,128 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 11:51:08,128 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1100492729, now seen corresponding path program 1 times [2019-12-07 11:51:08,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:08,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061441080] [2019-12-07 11:51:08,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:08,152 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 11:51:08,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061441080] [2019-12-07 11:51:08,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:08,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:51:08,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076392958] [2019-12-07 11:51:08,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:51:08,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:51:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:08,153 INFO L87 Difference]: Start difference. First operand 204 states and 242 transitions. Second operand 5 states. [2019-12-07 11:51:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:08,251 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2019-12-07 11:51:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:51:08,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:51:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:08,252 INFO L225 Difference]: With dead ends: 209 [2019-12-07 11:51:08,253 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 11:51:08,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 11:51:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-12-07 11:51:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-07 11:51:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2019-12-07 11:51:08,263 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 27 [2019-12-07 11:51:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:08,263 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2019-12-07 11:51:08,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:51:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2019-12-07 11:51:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:51:08,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:08,264 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 11:51:08,264 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1606658885, now seen corresponding path program 1 times [2019-12-07 11:51:08,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:08,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208692138] [2019-12-07 11:51:08,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:08,308 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 11:51:08,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208692138] [2019-12-07 11:51:08,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:08,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:51:08,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584407953] [2019-12-07 11:51:08,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:51:08,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:51:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:51:08,309 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand 6 states. [2019-12-07 11:51:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:08,427 INFO L93 Difference]: Finished difference Result 206 states and 241 transitions. [2019-12-07 11:51:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:51:08,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 11:51:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:08,428 INFO L225 Difference]: With dead ends: 206 [2019-12-07 11:51:08,428 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 11:51:08,428 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 11:51:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 11:51:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-12-07 11:51:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 11:51:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2019-12-07 11:51:08,434 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 30 [2019-12-07 11:51:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:08,435 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2019-12-07 11:51:08,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:51:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2019-12-07 11:51:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:51:08,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:08,435 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 11:51:08,435 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash 244598605, now seen corresponding path program 1 times [2019-12-07 11:51:08,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:08,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183347178] [2019-12-07 11:51:08,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:08,484 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 11:51:08,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183347178] [2019-12-07 11:51:08,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:08,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:51:08,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940119326] [2019-12-07 11:51:08,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:51:08,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:08,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:51:08,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:51:08,486 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 7 states. [2019-12-07 11:51:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:08,663 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2019-12-07 11:51:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:51:08,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 11:51:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:08,664 INFO L225 Difference]: With dead ends: 141 [2019-12-07 11:51:08,664 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 11:51:08,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:51:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 11:51:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 102. [2019-12-07 11:51:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 11:51:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2019-12-07 11:51:08,671 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 33 [2019-12-07 11:51:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:08,671 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2019-12-07 11:51:08,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:51:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2019-12-07 11:51:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:51:08,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:08,672 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 11:51:08,672 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 230228966, now seen corresponding path program 1 times [2019-12-07 11:51:08,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:08,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003961937] [2019-12-07 11:51:08,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:08,740 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 11:51:08,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003961937] [2019-12-07 11:51:08,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:08,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:51:08,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477217675] [2019-12-07 11:51:08,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:51:08,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:51:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:51:08,742 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 10 states. [2019-12-07 11:51:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:09,013 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2019-12-07 11:51:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:51:09,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-12-07 11:51:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:09,014 INFO L225 Difference]: With dead ends: 153 [2019-12-07 11:51:09,014 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 11:51:09,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:51:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 11:51:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 121. [2019-12-07 11:51:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 11:51:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-12-07 11:51:09,024 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 36 [2019-12-07 11:51:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:09,024 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-12-07 11:51:09,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:51:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-12-07 11:51:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:51:09,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:09,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] [2019-12-07 11:51:09,025 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1916495717, now seen corresponding path program 1 times [2019-12-07 11:51:09,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:09,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089479236] [2019-12-07 11:51:09,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:09,071 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 11:51:09,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089479236] [2019-12-07 11:51:09,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:09,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:51:09,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91579599] [2019-12-07 11:51:09,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:51:09,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:51:09,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:09,073 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 5 states. [2019-12-07 11:51:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:09,161 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-12-07 11:51:09,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:51:09,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 11:51:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:09,163 INFO L225 Difference]: With dead ends: 159 [2019-12-07 11:51:09,163 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 11:51:09,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:51:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 11:51:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-12-07 11:51:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 11:51:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2019-12-07 11:51:09,175 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 36 [2019-12-07 11:51:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:09,175 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2019-12-07 11:51:09,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:51:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2019-12-07 11:51:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:51:09,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:09,176 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 11:51:09,177 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:09,177 INFO L82 PathProgramCache]: Analyzing trace with hash 40219240, now seen corresponding path program 1 times [2019-12-07 11:51:09,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:09,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950805182] [2019-12-07 11:51:09,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:09,201 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 11:51:09,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950805182] [2019-12-07 11:51:09,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:09,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:51:09,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648950653] [2019-12-07 11:51:09,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:09,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:09,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:09,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:09,202 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand 4 states. [2019-12-07 11:51:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:09,245 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2019-12-07 11:51:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:51:09,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 11:51:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:09,246 INFO L225 Difference]: With dead ends: 112 [2019-12-07 11:51:09,246 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 11:51:09,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 11:51:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 11:51:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2019-12-07 11:51:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 11:51:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2019-12-07 11:51:09,259 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 36 [2019-12-07 11:51:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:09,259 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-12-07 11:51:09,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:51:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2019-12-07 11:51:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:51:09,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:09,260 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 11:51:09,260 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1813100635, now seen corresponding path program 1 times [2019-12-07 11:51:09,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:09,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125713525] [2019-12-07 11:51:09,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:09,304 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 11:51:09,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125713525] [2019-12-07 11:51:09,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:09,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:51:09,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091025358] [2019-12-07 11:51:09,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:51:09,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:09,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:51:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:51:09,305 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 7 states. [2019-12-07 11:51:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:09,385 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-12-07 11:51:09,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:51:09,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-07 11:51:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:09,386 INFO L225 Difference]: With dead ends: 129 [2019-12-07 11:51:09,386 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 11:51:09,386 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 11:51:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 11:51:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-07 11:51:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 11:51:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-12-07 11:51:09,396 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 37 [2019-12-07 11:51:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:09,396 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-12-07 11:51:09,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:51:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-12-07 11:51:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:51:09,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:09,396 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 11:51:09,397 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:09,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash 886532451, now seen corresponding path program 1 times [2019-12-07 11:51:09,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:09,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855933604] [2019-12-07 11:51:09,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:09,476 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 11:51:09,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855933604] [2019-12-07 11:51:09,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:09,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:51:09,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730495743] [2019-12-07 11:51:09,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:51:09,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:09,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:51:09,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:51:09,478 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 8 states. [2019-12-07 11:51:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:09,712 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2019-12-07 11:51:09,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:51:09,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 11:51:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:09,713 INFO L225 Difference]: With dead ends: 138 [2019-12-07 11:51:09,713 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 11:51:09,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:51:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 11:51:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-12-07 11:51:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 11:51:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2019-12-07 11:51:09,721 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 37 [2019-12-07 11:51:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:09,721 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2019-12-07 11:51:09,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:51:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2019-12-07 11:51:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 11:51:09,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:09,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] [2019-12-07 11:51:09,722 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1399822481, now seen corresponding path program 1 times [2019-12-07 11:51:09,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:09,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107140726] [2019-12-07 11:51:09,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:09,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 11:51:09,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107140726] [2019-12-07 11:51:09,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:09,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:51:09,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095772646] [2019-12-07 11:51:09,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:51:09,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:09,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:51:09,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:51:09,750 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand 6 states. [2019-12-07 11:51:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:09,802 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2019-12-07 11:51:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:51:09,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 11:51:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:09,803 INFO L225 Difference]: With dead ends: 102 [2019-12-07 11:51:09,803 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 11:51:09,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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 11:51:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 11:51:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 11:51:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 11:51:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 11:51:09,810 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 40 [2019-12-07 11:51:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:09,810 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 11:51:09,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:51:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 11:51:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 11:51:09,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:09,810 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] [2019-12-07 11:51:09,810 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash -418689955, now seen corresponding path program 1 times [2019-12-07 11:51:09,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:09,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779487962] [2019-12-07 11:51:09,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:09,844 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 11:51:09,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779487962] [2019-12-07 11:51:09,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:09,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:51:09,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363321033] [2019-12-07 11:51:09,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:51:09,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:09,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:51:09,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:51:09,845 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2019-12-07 11:51:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:09,906 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-12-07 11:51:09,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:51:09,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 11:51:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:09,907 INFO L225 Difference]: With dead ends: 84 [2019-12-07 11:51:09,907 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 11:51:09,907 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 11:51:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 11:51:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 11:51:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 11:51:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-12-07 11:51:09,914 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 46 [2019-12-07 11:51:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:09,914 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-12-07 11:51:09,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:51:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-12-07 11:51:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 11:51:09,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:09,914 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] [2019-12-07 11:51:09,915 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1808135729, now seen corresponding path program 1 times [2019-12-07 11:51:09,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:09,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285741016] [2019-12-07 11:51:09,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:09,950 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 11:51:09,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285741016] [2019-12-07 11:51:09,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:09,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:51:09,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662899240] [2019-12-07 11:51:09,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:51:09,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:51:09,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:51:09,951 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 6 states. [2019-12-07 11:51:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:10,011 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2019-12-07 11:51:10,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:51:10,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 11:51:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:10,012 INFO L225 Difference]: With dead ends: 84 [2019-12-07 11:51:10,012 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 11:51:10,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 11:51:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 11:51:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 11:51:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 11:51:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-12-07 11:51:10,018 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 49 [2019-12-07 11:51:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:10,019 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-12-07 11:51:10,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:51:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-12-07 11:51:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:51:10,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:10,019 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] [2019-12-07 11:51:10,019 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1375865821, now seen corresponding path program 1 times [2019-12-07 11:51:10,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:10,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297761463] [2019-12-07 11:51:10,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:10,101 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 11:51:10,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297761463] [2019-12-07 11:51:10,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:10,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:51:10,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678454931] [2019-12-07 11:51:10,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:51:10,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:51:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:51:10,102 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2019-12-07 11:51:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:10,290 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-12-07 11:51:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:51:10,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-07 11:51:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:10,291 INFO L225 Difference]: With dead ends: 89 [2019-12-07 11:51:10,291 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 11:51:10,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:51:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 11:51:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 11:51:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 11:51:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-12-07 11:51:10,298 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 51 [2019-12-07 11:51:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:10,298 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-12-07 11:51:10,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:51:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-12-07 11:51:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 11:51:10,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:10,298 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 11:51:10,298 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash 792624989, now seen corresponding path program 1 times [2019-12-07 11:51:10,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:10,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332339645] [2019-12-07 11:51:10,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:10,371 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 11:51:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332339645] [2019-12-07 11:51:10,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:10,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:51:10,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192937188] [2019-12-07 11:51:10,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:51:10,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:51:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:51:10,372 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 9 states. [2019-12-07 11:51:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:10,488 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-12-07 11:51:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:51:10,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-07 11:51:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:10,488 INFO L225 Difference]: With dead ends: 80 [2019-12-07 11:51:10,488 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:51:10,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:51:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:51:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:51:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:51:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:51:10,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2019-12-07 11:51:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:10,489 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:51:10,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:51:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:51:10,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:51:10,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:51:11,563 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-12-07 11:51:12,082 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 11:51:12,396 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-12-07 11:51:13,628 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 112 [2019-12-07 11:51:14,229 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-12-07 11:51:14,579 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-07 11:51:15,373 WARN L192 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 115 [2019-12-07 11:51:15,533 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-07 11:51:16,096 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-12-07 11:51:16,245 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-12-07 11:51:16,470 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-12-07 11:51:16,772 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-07 11:51:17,045 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-12-07 11:51:17,745 WARN L192 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 110 [2019-12-07 11:51:18,125 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 84 [2019-12-07 11:51:18,611 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-12-07 11:51:18,899 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-12-07 11:51:19,874 WARN L192 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 110 [2019-12-07 11:51:20,325 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 99 [2019-12-07 11:51:21,098 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-12-07 11:51:21,439 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 11:51:21,442 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,442 INFO L242 CegarLoopResult]: At program point L432(lines 161 434) the Hoare annotation is: (let ((.cse14 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse15 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse8 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse6 (= ~s~0 ~DC~0)) (.cse2 (= 0 ~pended~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse17 (= ~SKIP2~0 ~s~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse1 .cse2 .cse11 .cse6) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse14 .cse10 .cse11 .cse13 .cse15 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741670) 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) .cse6 .cse7 .cse9 .cse10 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse14 .cse10 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse11 .cse13 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)) .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse11 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) .cse6 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse10 .cse0 .cse1 .cse2 .cse11 .cse3 .cse13 .cse16 .cse17 .cse18 .cse7 .cse9) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 .cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse3 .cse16 .cse17 .cse7 .cse9 .cse10 .cse11 .cse13 .cse18))) [2019-12-07 11:51:21,442 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,443 INFO L242 CegarLoopResult]: At program point L763(lines 756 802) the Hoare annotation is: (let ((.cse12 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse13 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse14 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse2 (<= (+ ~s~0 5) ~IPC~0)) (.cse3 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse4 (= ~s~0 ~DC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse8 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse2 .cse4 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse7 .cse12 .cse8 .cse9 .cse13 .cse11 .cse14 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse12 .cse8 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse9 .cse11 .cse13 .cse14) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse9 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse4) (and .cse8 .cse0 .cse9 .cse1 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (= ~SKIP2~0 ~s~0) (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) .cse5 .cse7 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~myStatus~0 0) .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-12-07 11:51:21,443 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,443 INFO L249 CegarLoopResult]: At program point L764(lines 748 803) the Hoare annotation is: true [2019-12-07 11:51:21,443 INFO L246 CegarLoopResult]: For program point L302(lines 302 308) no Hoare annotation was computed. [2019-12-07 11:51:21,443 INFO L246 CegarLoopResult]: For program point L765(lines 765 800) no Hoare annotation was computed. [2019-12-07 11:51:21,443 INFO L246 CegarLoopResult]: For program point L237-1(lines 230 418) no Hoare annotation was computed. [2019-12-07 11:51:21,443 INFO L246 CegarLoopResult]: For program point L766(lines 766 799) no Hoare annotation was computed. [2019-12-07 11:51:21,443 INFO L242 CegarLoopResult]: At program point L568(lines 529 594) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse10 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse17 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse18 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse11 (<= (+ .cse20 1) 0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse15 .cse16)))) [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L767(lines 767 777) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L768(lines 768 774) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L241(lines 241 247) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1034(lines 1034 1053) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1034-1(lines 1034 1053) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1034-2(lines 1034 1053) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1034-3(lines 1034 1053) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L638(lines 638 643) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L638-2(lines 638 643) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1040) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1035-2(lines 1035 1040) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1035-4(lines 1035 1040) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L1035-6(lines 1035 1040) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point L112(lines 112 117) no Hoare annotation was computed. [2019-12-07 11:51:21,444 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,445 INFO L242 CegarLoopResult]: At program point L708(lines 702 806) the Hoare annotation is: (let ((.cse3 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse10 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0)) (.cse11 (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0)) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse17 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse14 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (= ~s~0 ~DC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse18 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse19 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse14 .cse15 .cse5 .cse16 (<= ~myStatus~0 0) .cse6 .cse7 .cse8 .cse17 .cse9) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse1 .cse8 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse15) (and .cse8 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) (= 0 (+ ULTIMATE.start_main_~status~1 1073741823)) .cse15 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse13 .cse14 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse17 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse5 .cse6 .cse18 .cse7 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse19 .cse9 .cse20) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse14 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse15 .cse5 .cse6 .cse18 .cse7 .cse8 .cse19 .cse9 .cse20 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))))) [2019-12-07 11:51:21,445 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,445 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,445 INFO L246 CegarLoopResult]: For program point L378(lines 378 384) no Hoare annotation was computed. [2019-12-07 11:51:21,445 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,445 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,445 INFO L242 CegarLoopResult]: At program point L645(lines 613 647) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= (+ ~s~0 5) ~MPR3~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse17 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse12 .cse13 .cse14) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse15 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse14)))) [2019-12-07 11:51:21,445 INFO L246 CegarLoopResult]: For program point L513(lines 513 518) no Hoare annotation was computed. [2019-12-07 11:51:21,446 INFO L242 CegarLoopResult]: At program point L513-2(lines 513 518) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 11:51:21,446 INFO L242 CegarLoopResult]: At program point L1042(lines 1034 1053) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,446 INFO L242 CegarLoopResult]: At program point L1042-1(lines 1034 1053) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,446 INFO L242 CegarLoopResult]: At program point L1042-2(lines 1034 1053) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,446 INFO L242 CegarLoopResult]: At program point L1042-3(lines 1034 1053) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,446 INFO L242 CegarLoopResult]: At program point L977(lines 941 1005) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,446 INFO L242 CegarLoopResult]: At program point L977-1(lines 941 1005) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L977-2(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L977-3(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L977-4(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L977-5(lines 941 1005) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L977-6(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L779(lines 766 799) the Hoare annotation is: (let ((.cse1 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~s~0 ~DC~0))) (let ((.cse3 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse4 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= ULTIMATE.start_main_~status~1 0)) (.cse7 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse8 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse5 (<= (+ ~s~0 5) ~IPC~0)) (.cse9 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse0 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (let ((.cse12 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse13 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse14 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse12 .cse13 .cse10 .cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) .cse15 .cse16 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse12 .cse13 .cse10 .cse14 .cse11 .cse15 .cse16))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse2 .cse4 .cse5 .cse6) (and (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse0 .cse7 .cse2 .cse5 .cse8 .cse9) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse11) (and .cse3 .cse0 .cse2 .cse4 .cse5 .cse6 (<= ~myStatus~0 0)) (and (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse7 .cse0 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse2 .cse8 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (<= (+ ULTIMATE.start_main_~status~1 1073741675) 0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~s~0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741675) ~IPC~0) .cse0 .cse2 (<= (+ |ULTIMATE.start_FloppyPnp_#res| ~s~0 1073741675) ~IPC~0) (<= (+ ~s~0 ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741675) ~IPC~0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| ~DC~0 1073741675) ~IPC~0))))) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L977-7(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,447 INFO L242 CegarLoopResult]: At program point L977-8(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,448 INFO L242 CegarLoopResult]: At program point L119(lines 119 149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,448 INFO L246 CegarLoopResult]: For program point L119-2(lines 111 159) no Hoare annotation was computed. [2019-12-07 11:51:21,448 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,448 INFO L246 CegarLoopResult]: For program point L320(lines 320 332) no Hoare annotation was computed. [2019-12-07 11:51:21,448 INFO L246 CegarLoopResult]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2019-12-07 11:51:21,448 INFO L242 CegarLoopResult]: At program point L1047-1(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 11:51:21,448 INFO L246 CegarLoopResult]: For program point L1047-2(lines 1047 1051) no Hoare annotation was computed. [2019-12-07 11:51:21,448 INFO L242 CegarLoopResult]: At program point L1047-3(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 11:51:21,448 INFO L246 CegarLoopResult]: For program point L1047-4(lines 1047 1051) no Hoare annotation was computed. [2019-12-07 11:51:21,448 INFO L242 CegarLoopResult]: At program point L1047-5(lines 1047 1051) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,448 INFO L246 CegarLoopResult]: For program point L1047-6(lines 1047 1051) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L242 CegarLoopResult]: At program point L1047-7(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L785(lines 785 797) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L786(lines 786 790) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-1(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-2(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-3(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-4(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-5(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-6(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-7(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L985-8(lines 985 1002) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,449 INFO L246 CegarLoopResult]: For program point L325(lines 325 331) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L242 CegarLoopResult]: At program point L325-1(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L261(lines 261 292) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-1(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-2(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-3(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-4(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-5(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-6(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-7(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-8(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-9(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-10(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-11(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-12(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-13(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,450 INFO L246 CegarLoopResult]: For program point L63-14(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-15(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-16(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-17(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-18(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-19(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-20(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-21(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-22(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-23(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-24(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-25(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-26(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-27(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-28(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L242 CegarLoopResult]: At program point L130(lines 130 137) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-29(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L246 CegarLoopResult]: For program point L63-30(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,451 INFO L242 CegarLoopResult]: At program point L64(lines 1007 1020) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ~s~0 ~DC~0)) [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-31(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-32(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-33(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-34(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L242 CegarLoopResult]: At program point L64-4(lines 1 1149) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse1 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-35(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-36(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-37(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L242 CegarLoopResult]: At program point L64-7(lines 1 1149) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse1 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-38(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L246 CegarLoopResult]: For program point L63-39(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,452 INFO L242 CegarLoopResult]: At program point L64-9(lines 1007 1020) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse5 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse11 .cse12 .cse13 .cse14) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse15 .cse5 .cse6 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-10(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-12(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-13(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-15(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-17(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-19(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-21(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-25(lines 1 1149) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse1 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,453 INFO L242 CegarLoopResult]: At program point L64-28(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,454 INFO L242 CegarLoopResult]: At program point L64-30(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,454 INFO L242 CegarLoopResult]: At program point L64-31(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,454 INFO L242 CegarLoopResult]: At program point L64-33(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,454 INFO L242 CegarLoopResult]: At program point L64-34(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L924(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L242 CegarLoopResult]: At program point L64-36(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L924-2(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L924-4(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L792(lines 792 796) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L924-6(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L924-8(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L924-10(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,454 INFO L246 CegarLoopResult]: For program point L924-12(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L924-14(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L924-16(lines 924 930) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L529(lines 529 594) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L529-1(lines 529 594) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L199(lines 199 207) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L531(lines 531 571) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-2(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-4(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-6(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-8(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-10(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-12(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L242 CegarLoopResult]: At program point L532(lines 532 542) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse18 1) 0)) (.cse11 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17)))) [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-14(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,455 INFO L246 CegarLoopResult]: For program point L994-16(lines 994 1001) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L242 CegarLoopResult]: At program point L731(lines 731 746) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L242 CegarLoopResult]: At program point L665(lines 725 727) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point L272(lines 272 278) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L242 CegarLoopResult]: At program point L208(lines 208 427) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point L341(lines 341 346) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point L341-2(lines 341 346) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,456 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,457 INFO L249 CegarLoopResult]: At program point L805(lines 668 807) the Hoare annotation is: true [2019-12-07 11:51:21,457 INFO L246 CegarLoopResult]: For program point L211(lines 211 426) no Hoare annotation was computed. [2019-12-07 11:51:21,457 INFO L246 CegarLoopResult]: For program point L145(lines 145 147) no Hoare annotation was computed. [2019-12-07 11:51:21,457 INFO L242 CegarLoopResult]: At program point L544(lines 531 571) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse18 1) 0)) (.cse11 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17)))) [2019-12-07 11:51:21,457 INFO L246 CegarLoopResult]: For program point L214(lines 214 425) no Hoare annotation was computed. [2019-12-07 11:51:21,457 INFO L242 CegarLoopResult]: At program point L215(lines 211 426) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,457 INFO L242 CegarLoopResult]: At program point L942(lines 942 954) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 11:51:21,457 INFO L242 CegarLoopResult]: At program point L942-1(lines 942 954) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,457 INFO L242 CegarLoopResult]: At program point L942-2(lines 942 954) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-3(lines 942 954) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-4(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-5(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-6(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-7(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-8(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-9(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-10(lines 942 954) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-11(lines 942 954) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 11:51:21,458 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,458 INFO L242 CegarLoopResult]: At program point L942-12(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,459 INFO L242 CegarLoopResult]: At program point L942-13(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,459 INFO L242 CegarLoopResult]: At program point L942-14(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,459 INFO L242 CegarLoopResult]: At program point L942-15(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,459 INFO L242 CegarLoopResult]: At program point L942-16(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,459 INFO L242 CegarLoopResult]: At program point L942-17(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 11:51:21,459 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,459 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,459 INFO L246 CegarLoopResult]: For program point L217(lines 217 424) no Hoare annotation was computed. [2019-12-07 11:51:21,459 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:51:21,459 INFO L242 CegarLoopResult]: At program point L86(lines 708 747) the Hoare annotation is: (let ((.cse1 (+ ~s~0 5)) (.cse0 (not (= ~s~0 ~NP~0)))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 ~MPR3~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1))) [2019-12-07 11:51:21,459 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1017) no Hoare annotation was computed. [2019-12-07 11:51:21,459 INFO L246 CegarLoopResult]: For program point L1011-2(lines 1011 1017) no Hoare annotation was computed. [2019-12-07 11:51:21,459 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,460 INFO L246 CegarLoopResult]: For program point L1011-4(lines 1011 1017) no Hoare annotation was computed. [2019-12-07 11:51:21,460 INFO L246 CegarLoopResult]: For program point L1011-6(lines 1011 1017) no Hoare annotation was computed. [2019-12-07 11:51:21,460 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,460 INFO L246 CegarLoopResult]: For program point L220(lines 220 423) no Hoare annotation was computed. [2019-12-07 11:51:21,460 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,460 INFO L246 CegarLoopResult]: For program point L749(lines 749 753) no Hoare annotation was computed. [2019-12-07 11:51:21,460 INFO L242 CegarLoopResult]: At program point L551-2(lines 551 567) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse10 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse17 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse18 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse11 (<= (+ .cse20 1) 0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)))) (or (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17 .cse18 .cse19) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse15 .cse16)))) [2019-12-07 11:51:21,460 INFO L242 CegarLoopResult]: At program point L419(lines 230 420) the Hoare annotation is: (let ((.cse12 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= 0 ULTIMATE.start_main_~status~1)) (.cse8 (<= (+ ~DC~0 5) ~IPC~0)) (.cse9 (= 0 ~pended~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (<= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 .cse1 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse3 .cse4 .cse5 (= ~SKIP2~0 ~s~0) .cse6 .cse7) (and .cse1 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse2 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse8 .cse9 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse10 .cse6 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse11 .cse7 .cse0 .cse3 .cse4 .cse12 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse1 .cse2 .cse8 .cse9 .cse5 .cse10 .cse6 .cse7 .cse0 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse3 .cse4 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)) .cse12) (and .cse1 .cse2 .cse8 .cse9 .cse5 .cse13 .cse10 .cse6 .cse11 (<= ~myStatus~0 0) .cse7 .cse0 .cse3 .cse4) (and .cse2 .cse3 .cse10 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse1 .cse2 .cse8 .cse9 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse5 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) .cse10 .cse6 .cse7 .cse0 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse9 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse13 .cse10 .cse6 .cse11 .cse7 .cse0 .cse3 .cse4))) [2019-12-07 11:51:21,460 INFO L242 CegarLoopResult]: At program point L221(lines 217 424) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-2(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-4(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-6(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-8(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-10(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L242 CegarLoopResult]: At program point L552(lines 551 567) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse10 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse17 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse18 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse11 (<= (+ .cse20 1) 0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)))) (or (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17 .cse18 .cse19) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse15 .cse16)))) [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-12(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-14(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point L948-16(lines 948 952) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,461 INFO L242 CegarLoopResult]: At program point L223(lines 223 422) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,461 INFO L242 CegarLoopResult]: At program point L158(lines 98 160) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,462 INFO L242 CegarLoopResult]: At program point L226(lines 226 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,462 INFO L242 CegarLoopResult]: At program point L755(lines 748 803) the Hoare annotation is: (let ((.cse3 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse10 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0)) (.cse11 (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0)) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse17 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse14 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (= ~s~0 ~DC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse18 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse19 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse14 .cse15 .cse5 .cse16 (<= ~myStatus~0 0) .cse6 .cse7 .cse8 .cse17 .cse9) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse1 .cse8 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse15) (and .cse8 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) (= 0 (+ ULTIMATE.start_main_~status~1 1073741823)) .cse15 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse13 .cse14 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse17 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse5 .cse6 .cse18 .cse7 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse19 .cse9 .cse20) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse14 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse15 .cse5 .cse6 .cse18 .cse7 .cse8 .cse19 .cse9 .cse20 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))))) [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point L492(lines 492 504) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point L757(lines 757 761) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point L361(lines 361 367) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L242 CegarLoopResult]: At program point L229(lines 228 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point L296-1(lines 230 418) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point L628(lines 628 630) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,462 INFO L246 CegarLoopResult]: For program point L563(lines 563 565) no Hoare annotation was computed. [2019-12-07 11:51:21,463 INFO L246 CegarLoopResult]: For program point L497(lines 497 503) no Hoare annotation was computed. [2019-12-07 11:51:21,463 INFO L242 CegarLoopResult]: At program point L497-1(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 11:51:21,463 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-12-07 11:51:21,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:51:21 BoogieIcfgContainer [2019-12-07 11:51:21,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:51:21,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:51:21,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:51:21,525 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:51:21,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:04" (3/4) ... [2019-12-07 11:51:21,528 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:51:21,550 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 206 nodes and edges [2019-12-07 11:51:21,553 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 66 nodes and edges [2019-12-07 11:51:21,555 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 11:51:21,558 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:51:21,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((NP + 5 <= MPR3 && \result + 1073741823 == 0) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) [2019-12-07 11:51:21,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((NP + 5 <= MPR3 && \result + 1073741823 == 0) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) [2019-12-07 11:51:21,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || ((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) [2019-12-07 11:51:21,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((DC + 2 <= SKIP2 && SKIP2 == s) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) || ((((((\result <= 0 && DC + 2 <= SKIP2) && ntStatus <= 0) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && ntStatus <= 0) && s + 5 <= IPC) && status <= 0)) || ((((((((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (260 <= \result || \result <= 258))) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((\result <= 0 && DC + 2 <= SKIP2) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && ntStatus <= 0) && s + 5 <= IPC) && status <= 0) && myStatus <= 0)) || (((((((((((258 < __cil_tmp11 || ntStatus <= __cil_tmp11) && (260 <= \result || \result <= 258)) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && (260 <= ntStatus || ntStatus <= 258)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (260 <= \result || \result <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((status + 1073741675 <= 0 && DC + 5 <= IPC) && s + ntStatus + 1073741675 <= IPC) && DC + 2 <= SKIP2) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && \result + s + 1073741675 <= IPC) && s + ntStatus + 1073741675 <= IPC) && \result + DC + 1073741675 <= IPC) [2019-12-07 11:51:21,582 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || ((((\result + 1073741738 <= 0 && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && s == DC)) || ((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((((((((((((\result + 1073741670 <= 0 && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus + 1073741670 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || ((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || ((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((0 <= status && NP + 5 <= MPR3) && \result + 1073741823 == 0) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) [2019-12-07 11:51:21,585 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((ntStatus <= lowerDriverReturn && returnVal2 <= lowerDriverReturn) && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || ((((0 <= status && NP + 5 <= MPR3) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus + 1073741670 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) [2019-12-07 11:51:21,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 11:51:21,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || ((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 11:51:21,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || ((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 11:51:21,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && ntStatus + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) [2019-12-07 11:51:21,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 11:51:21,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && ntStatus + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) [2019-12-07 11:51:21,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) [2019-12-07 11:51:21,684 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc29d333-49f5-4afc-80c6-32806c269b78/bin/utaipan/witness.graphml [2019-12-07 11:51:21,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:51:21,685 INFO L168 Benchmark]: Toolchain (without parser) took 18798.19 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 488.6 MB). Free memory was 935.3 MB in the beginning and 1.2 GB in the end (delta: -309.7 MB). Peak memory consumption was 179.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:51:21,685 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:51:21,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:51:21,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.03 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:51:21,686 INFO L168 Benchmark]: Boogie Preprocessor took 56.54 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 11:51:21,686 INFO L168 Benchmark]: RCFGBuilder took 1337.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.0 MB). Peak memory consumption was 242.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:51:21,686 INFO L168 Benchmark]: TraceAbstraction took 16864.48 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 400.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -272.8 MB). Peak memory consumption was 635.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:51:21,686 INFO L168 Benchmark]: Witness Printer took 159.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:51:21,688 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.03 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.54 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. * RCFGBuilder took 1337.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.0 MB). Peak memory consumption was 242.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16864.48 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 400.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -272.8 MB). Peak memory consumption was 635.3 MB. Max. memory is 11.5 GB. * Witness Printer took 159.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || ((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && ntStatus + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 731]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: (((((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: (((((((DC + 2 <= SKIP2 && SKIP2 == s) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) || ((((((\result <= 0 && DC + 2 <= SKIP2) && ntStatus <= 0) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && ntStatus <= 0) && s + 5 <= IPC) && status <= 0)) || ((((((((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (260 <= \result || \result <= 258))) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((\result <= 0 && DC + 2 <= SKIP2) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && ntStatus <= 0) && s + 5 <= IPC) && status <= 0) && myStatus <= 0)) || (((((((((((258 < __cil_tmp11 || ntStatus <= __cil_tmp11) && (260 <= \result || \result <= 258)) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && (260 <= ntStatus || ntStatus <= 258)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (260 <= \result || \result <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((status + 1073741675 <= 0 && DC + 5 <= IPC) && s + ntStatus + 1073741675 <= IPC) && DC + 2 <= SKIP2) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && \result + s + 1073741675 <= IPC) && s + ntStatus + 1073741675 <= IPC) && \result + DC + 1073741675 <= IPC) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || ((((\result + 1073741738 <= 0 && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && s == DC)) || ((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((((((((((((\result + 1073741670 <= 0 && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus + 1073741670 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || ((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || ((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((0 <= status && NP + 5 <= MPR3) && \result + 1073741823 == 0) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 668]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: (((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && 0 == pended) && s == NP) && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || ((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((NP + 5 <= MPR3 && \result + 1073741823 == 0) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((NP + 5 <= MPR3 && \result + 1073741823 == 0) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((ntStatus <= lowerDriverReturn && returnVal2 <= lowerDriverReturn) && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || ((((0 <= status && NP + 5 <= MPR3) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus + 1073741670 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && ((!(s == NP) || 260 <= ntStatus) || ntStatus <= 258)) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status <= lowerDriverReturn) && lowerDriverReturn <= status - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || ((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && ntStatus + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 255 locations, 40 error locations. Result: SAFE, OverallTime: 5.7s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.9s, HoareTripleCheckerStatistics: 6437 SDtfs, 6029 SDslu, 7747 SDs, 0 SdLazy, 3707 SolverSat, 486 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 561 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 82 PreInvPairs, 253 NumberOfFragments, 8486 HoareAnnotationTreeSize, 82 FomulaSimplifications, 579919 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 82 FomulaSimplificationsInter, 85953 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 948 ConstructedInterpolants, 0 QuantifiedInterpolants, 89709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...